CONCEPT
Computational Irreducibility
The structural property of complex systems—demonstrated by
Wolfram in the behavior of simple cellular automata—by which there is no shortcut to knowing the future: the only way to find out what the system will do is to run it, step by step, all the way through.
For three centuries, science’s deepest ambition was the shortcut: write down the laws governing a system and calculate its future without living through it. Newtonian mechanics let you predict where the planets will be in a thousand years without waiting. The whole prestige of mathematical physics rests on this power.
Stephen Wolfram’s discovery was that the shortcut is the exception, not the rule. He showed, most vividly in the cellular automaton rule 30, that a system defined by a single line of trivially simple rules generates a pattern of such apparent randomness that no formula lets you leap ahead—to know what the pattern will be a million steps down, you must compute every preceding step. This is not a gap in current knowledge to be filled by cleverer mathematics. It is a structural property of the system: the process is computationally irreducible, and no intelligence, however vast, can transcend