Ankur Moitra
MIT mathematician and theoretical computer scientist, visiting the Institute for Advanced Study
Ankur Moitra (MIT mathematician and theoretical computer scientist, visiting the Institute for Advanced Study) has appeared as a guest on 1 episode in TMT. Topics they speak about most include Artificial intelligence, Mathematics education, P versus NP problem.
In their words
Positions and remarks grouped by topic, each with the exact quote and where it was said.
Artificial intelligence
Moitra argues deep learning succeeds on worst-case-hard problems because natural data has evolved structure that makes them easy.
“I guess my version of it is that in some sense, nature abhors computationally hard problems”
Lex Fridman Podcast: #503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory (Oct 26, 2026) · Listen from 2:58:03
Moitra worries that mathematicians may become more secretive with partial ideas because AI could rapidly exploit them.
“maybe people become a little bit more secretive with those ideas than they were in the past”
Lex Fridman Podcast: #503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory (Oct 26, 2026) · Listen from 1:35:18
Moitra says the traditional career blueprint for mathematics students has been invalidated by AI, making advising harder.
“you know, the playbook and the blueprint for success that we had for so long is now thrown out the window”
Lex Fridman Podcast: #503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory (Oct 26, 2026) · Listen from 11:37
Mathematics education
Moitra advises young people to act as if they had already succeeded and pursue what they genuinely value.
“Pretend you already have tenure. What would you now do?”
Lex Fridman Podcast: #503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory (Oct 26, 2026) · Listen from 3:35:02
P versus NP problem
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
Unique games conjecture
Moitra admits he had at times doubted the unique games conjecture because its consequences seemed too strong.
“I did find myself on the side of the doubters because unique games just sounded too nice to be true”
Lex Fridman Podcast: #503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory (Oct 26, 2026) · Listen from 2:19:02
Doorman fallacy
Moitra argues, via the doorman fallacy, that reducing mathematicians to theorem-provers misses their broader role and that panic is unwarranted.
“So even though this is a momentous time, I don't think it's the right time to hit the panic button”
Lex Fridman Podcast: #503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory (Oct 26, 2026) · Listen from 27:17
Appearances
#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.
Often appears with
- Lex Fridman · 1 shared episode
- Alex Kontorovich · 1 shared episode
- Steven Brunton · 1 shared episode