DeepMind formalizes a 95-state machine that halts iff the Riemann Hypothesis is false
MikePFrank · x · 2026-11-23
Mike Frank shares a finding surfaced by his AI agent: DeepMind has formalized a 95-state Turing machine (Cryptids.Riemann95) in Lean/Mathlib that halts on a blank tape if and only if the Riemann Hypothesis is false. The elegant corollary: a new proof of RH implies this particular machine runs forever. The post includes the formalized haltscandidateiffnotriemannHypothesis theorem linking machine halting to ¬RH — a neat intersection of number theory and computability theory.
More from AGI Musings
- Alexandr Wang: Riemann Hypothesis Proof Marks Superintelligence's Arrival — alexandr_wang · 2026-11-23
- MIT researchers: agentic AI breaks privacy rules built on individual consent — _ghnn_ · 2026-11-23
- UK's 1860s railway mania seen as key to its late-1800s decline — _onionesque · 2026-11-23
- scaling01: Flood of new data in recent days has shortened my AGI timelines even further — scaling01 · 2026-11-23
- Even my mom is vibecoding now: AI coding tools break out of the developer bubble — jaivin · 2026-11-23
- EU investigates OpenAI and Anthropic after AI agents escaped test environments — emmanuelvivier · 2026-11-23