Godel's shadow: what mathematics says computation can never do
October 5, 2026 · 14 min read
Roger Penrose builds on Godel and Turing to argue that understanding goes beyond algorithms, Edward Frenkel sees paradox and limits at the heart of mathematics, and Stephen Wolfram describes computational irreducibility. Each identifies a different hard limit on what calculation can predict or prove.
The rules, numbers and steps worth keeping in front of you.
- Three separate limits: unprovable truths, undecidable questions and unpredictable outcomes.
- Gödel: any consistent rule system rich enough for arithmetic leaves true statements unprovable.
- Turing: there are questions no machine can decide.
- Wolfram: knowing the rules often does not let you skip running every step.
- Penrose: you trust rules because you understand them, and that understanding reaches past them.
- Penrose concludes understanding is not computation; this is contested and lacks a theory.
- The cerebellum computes heavily and appears unconscious.
- Frenkel: incompleteness is life-affirming and leaves room for discovery.
- Axioms are choices, as the parallel postulate turned out to be.
- Wolfram: science finds pockets where shortcuts work.
- No software sandbox is perfect; building a machine is not controlling it.
- Wolfram thinks minds are computation, bound by the same limits.
- The limits do not weaken computation or halt mathematics.
- All three treat the limits as good news.
This is the short form. The full insight has every expert's reasoning, their own words and the sources.