P versus NP problem
Subject in Mathematics
P versus NP problem has come up in 1 episode across 1 podcast in TMT, including Lex Fridman Podcast. 1 person has made recorded remarks about it.
What people said
Ankur MoitraMIT mathematician and theoretical computer scientist, visiting the Institute for Advanced Study
Moitra bets that many practical instances of worst-case-hard problems are secretly easy, while hard instances for cryptography still exist.
“But it could be that in practice, a lot of the problems that we model in the worst case are secretly easy”
Lex Fridman Podcast: #503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory (Oct 26, 2026) · Listen from 3:14:27
Podcasts
- Lex Fridman Podcast · 1 episode
Episodes
#503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity TheoryLex Fridman Podcast · Oct 26, 2026 · 3 h 43 min
Lex Fridman and mathematicians Alex Kontorovich, Ankur Moitra and Steven Brunton discuss AI's claimed proofs of quasi-Riemann, Navier-Stokes, unique games and what it means for mathematics.