causal
Computational Irreducibility Limits Prediction
Many systems are computationally irreducible, meaning the only way to find out what they will do is to run every step, because the observer is itself a computational system that is computationally equivalent to the system being predicted and therefore cannot jump ahead or outsmart it.
causalpending
Speaker
Stephen WolframEvidence Quote
“if it was the case that you could really be smarter than the system you're trying to predict, then yes, you could potentially jump ahead, but what the principle of computational equivalence says is, no, actually that won't be that way. You will be exactly computationally equivalent to the system you're trying to predict.”
Source
155 | Stephen Wolfram on Computation, Hypergraphs, and Fundamental Physics— Sean Carroll's MindscapeCreated: 6/13/2026, 3:30:55 AM
My Notes
Loading notes...