Infinite monkeys, Lean compiler: can brute-force proof search teach us anything?
MilesCranmer · x · 2026-11-20
Miles Cranmer reflects on the AI formal-proof milestone: with infinite compute and a Lean compiler you can find any proof — mathematics via the infinite monkey theorem. But he asks the deeper question: do we actually learn anything from it? A timely counterpoint to the massive Riemann hypothesis Lean proof discussion.
More from Research
- GPTZero scans millions of citations: hallucination rates flat or rising at CVPR, ICLR, EMNLP — HanchungLee · 2026-11-21
- Riemann Hypothesis by end of 2026: bold AI timeline prediction doubles down — dioscuri · 2026-11-21
- Evidence Guide launches: a home for computational audits of research papers — Ben_Reinhardt · 2026-11-21
- Blogger: OpenAI model's Erdős unit distance result was 'priced in' long ago — JacquesThibs · 2026-11-21
- "Wright Brothers first flight for math": KOLs hail a new era after math breakthrough — jamesdouma · 2026-11-21
- Stanford-led paper: 27B open model rewrites its own weights, gains 6.6 points without training — rohanpaul_ai · 2026-11-21