Computational irreducibility is a fundamental concept where complex systems like Rule 30 cannot be predicted or compressed—the only way to determine their outcome is effectively to watch them evolve, which has deep implications for the limits of scientific prediction.

factualpending

Speaker

Stephen Wolfram

Evidence Quote

“something like this is fundamentally irreducible. The only way to find its outcome is, effectively, just to watch it evolve.”

Source

Computing a theory of everything | Stephen Wolfram— TED
Created: 8/11/2026, 1:17:00 AM

Your notes

Loading notes...