#503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory
Ankur Moitra, Steven Brunton and Alex Kontorovich are three mathematicians who can speak to this incredible moment in the history of mathematics, when AI solved some of its hardest problems: Navier-Stokes, the quasi-Riemann hypothesis, the unique games conjecture and hundreds of other problems. Ankur Moitra is a mathematician at MIT (visiting the Institute…
Notes
-
-
-
-
Did AI Solve the Riemann Hypothesis? at 19:40
-
-
-
-
-
-
-
What Is the Riemann Hypothesis? at 1:14:33
-
How Long Is Fermat's Last Theorem in Lean? at 1:18:20
-
-
-
Why Is a Fluid So Hard to Solve? at 1:39:25
-
What Is the Basic Building Block of a Fluid? at 1:48:12
-
What Did AI Prove About Navier-Stokes? at 1:50:20
-
Why Is Turbulence So Hard? at 1:59:01
-
-
Did AI Prove the Unique Games Conjecture? at 2:12:40
-
How Many Authors Does a Math Paper Have? at 2:28:56
-
How Do AI Swarms Act Like the Game of Life? at 3:07:42
-
What Should Pure Math PhD Students Learn? at 3:26:10
-
-
-
Related notes
- Are the Scientists Trying to Make Tools to Solve What Humans Can’t Solve or Replicate Human Intelligence
- What Is the Next Step in How Artificial Intelligence Advances
- Why Do Mathematicians Call the New Proofs an Alien Intelligence?
- Can AI Solve Hundred Year Old Math Problems?
- Will Humans Stay in Control of AI?
- Does AI Dwarf Everything Else?