Skip to content
The Chat Archive
claude-3-7-sonnet-20250219· Anthropic LMArena Human Preference 140K

How easy is it to write a computer program that outputs something, that would be very…

  1. User

    How easy is it to write a computer program that outputs something, that would be very difficult to define by a mathematical formula. Simplicity of program vs formula.

  2. Assistant

    This is a fascinating question that touches on algorithmic complexity and expressiveness.

    It's actually quite easy to write simple programs that produce outputs that would require extremely complex mathematical formulas to define directly. This is essentially what makes programming so powerful.

    A classic example is Conway's Game of Life - just a few lines of code implementing simple rules that produce incredibly complex patterns. Describing the state of a Game of Life board after 1000 iterations with a direct mathematical formula would be practically impossible.

    Another example is a pseudorandom number generator. A tiny program using something like a linear congruential generator can produce a sequence that would require an enormous polynomial to express directly.

    Fractals like the Mandelbrot set also demonstrate this principle - the generating program is trivial (z = z² + c), but describing the exact boundary of the set with a closed-form formula is extraordinarily difficult.

    This asymmetry between program simplicity and formula complexity is related to concepts in computational theory like Kolmogorov complexity - the idea that some objects are more efficiently described by the program that generates them than by their direct representation.

    What kind of outputs are you particularly interested in exploring?

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.