Computational irreducibility means that even when you have the complete underlying rules for a system, you cannot predict the outcome by any shortcut more efficient than running the simulation forward step-by-step.
definitionpending
Speaker
Stephen WolframEvidence Quote
“even when you know the scientific rules by which something should operate knowing what's actually going to happen is something that's kind of computationally irreducible”
Source
A conversation between Nassim Nicholas Taleb and Stephen Wolfram at the Wolfram Summer School 2021— WolframCreated: 8/11/2026, 1:49:43 AM
Your notes
Loading notes...