Computational irreducibility, a term coined by mathematician and physicist Stephen Wolfram in A New Kind of Science (2002), names processes whose outcome cannot be reached by any theoretical shortcut: “the only way to determine the outcome of a process is to go through each step of its computation.” Wolfram developed the idea while studying simple cellular automata — grids of cells governed by short, deterministic rules — and found that many, despite minimal starting instructions, generate patterns so intricate that no formula or approximation can leap ahead to a later state; the computation itself must run.
The idea pairs with Wolfram’s principle of computational equivalence, which holds that almost any system whose behaviour isn’t obviously simple is already computing at the same level of sophistication as any computer, including a mind. Where classical science assumes complexity can eventually be compressed into predictive equations, computational irreducibility proposes a hard limit: weather, ecosystems, cultures and minds may be their own fastest simulation. It resonates with chaos theory’s sensitivity to initial conditions, and with the broader intuition that some outcomes are only reachable by living through them, not modelling around them.
Wolfram on computational irreducibility
Also see Emergence and Complex Adaptive Systems Theory