Langford: proofs are now only machine-checkable, like compiled programs
JohnCLangford · x · 2026-11-21
Quoted context: the Riemann proof reportedly spans 250,000+ pages in English, with a Lean version too big to share across 14 part files — a collaboration between Antonio Alpoge and Claude requiring frequent steering. John Langford comments that we're in a new era where proofs are only machine-checkable, like compiled programs, and that's great because it lets us tackle new questions.
More from AGI Musings
- 'Quitting programming over AI is like a math teacher quitting over calculators' — prasenx · 2026-11-21
- Riemann Hypothesis by end of 2026: bold AI timeline prediction doubles down — dioscuri · 2026-11-21
- "Any math problem is solvable with the n-th model and industrial compute" — math-engineering declared the future — basedjensen · 2026-11-21
- The AI bubble playbook: from 100x VC returns to the Fed tightening, mapped step by step — Svwang1 · 2026-11-21
- Dario Amodei: Anthropic is deliberately running at less than half the speed it could — rohanpaul_ai · 2026-11-21
- Semi-autonomous agents exploit CVEs at a pace 2005-era security norms can't handle — chrisrohlf · 2026-11-21