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.

Original post →

More from AGI Musings

AGI Musings channel →