What Ankur Moitra has said about P versus NP problem
1 quote · 1 episode · Oct 26, 2026
Ankur Moitra, MIT mathematician and theoretical computer scientist, visiting the Institute for Advanced Study, has been quoted on P versus NP problem once in 1 episode of Lex Fridman Podcast, most recently on October 26, 2026. Each quote below is verbatim and links to the moment it was said.
In their words
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
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.
Ankur Moitra on other topics
- Artificial intelligence · 3 quotes
- Mathematics education · 1 quote
- Unique games conjecture · 1 quote
- Doorman fallacy · 1 quote