AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory | Lex Fridman Podcast #503
Mathematicians Ankur Moitra, Steven Brunton, and Alex Kontorovich analyze the seismic impact of automated AI theorem-provers after releases by OpenAI and Anthropic claimed solutions to landmark problems including the Unique Games Conjecture, the Quasi-Riemann Hypothesis, and Navier-Stokes finite-time blowup. They explore the mathematical validity of these proofs, the disruption to traditional academic careers and mentorship, and how automated formal verification in Lean is reshaping scientific discovery.
- AI theorem provers from labs like OpenAI and Anthropic are claiming answers to landmark problems, including the Unique Games Conjecture, the Quasi-Riemann Hypothesis, and Navier-Stokes finite-time blowup. Read →
- AI theorem provers from OpenAI and Anthropic helped verify a counterexample showing finite-time blowup in the 3D Navier-Stokes equations under smooth external forcing. Read →
- OpenAI established a proof for the Quasi-Riemann Hypothesis by verifying an infinite zero-free vertical strip between seven-eighths and one in the complex plane. Read →
- Real-world data sidesteps theoretical worst-case cryptography. "There's the saying in physics that nature abhors a vacuum," Ankur Moitra explains. "My version of it is that in some sense, nature abhors computationally hard problems." Read →