Scott Aaronson on AI cracking decades-old math problems — and whether P vs. NP is next
romanyam · x · 2026-10-29
On The Roman Forum podcast, host romanyam talks with theoretical computer scientist Scott Aaronson about AI solving mathematical problems that stumped humanity for decades, whether P vs. NP could fall next, and if human mathematicians are becoming obsolete. He also notes that after the interview, OpenAI claimed to have shown the Exponential Time Hypothesis to be false.
Related event: Scott Aaronson on AI solving decades-old math problems(2 posts)→
More from AGI Musings
- Investor krishnan says he's ready to debate the death of labor-based consulting — krishnan · 2026-10-29
- Harvard Hum 10 applications up 40% as LLMs hailed as best-ever book discussion partners — NathanpmYoung · 2026-10-29
- Commentary on 'Sleep' paper: test consolidation against retrieval before replacing it — krishnan · 2026-10-29
- Essay on the society of algorithms: coding elite vs the cybertariat — abenitezburraco · 2026-10-29
- Stanford no-tech classroom rule made the same lecture take 50% longer to cover — Afinetheorem · 2026-10-29
- Cognitive Scientists: AI Can Out-Generate Humans but Can't Replace Hollywood's Creative Teams — adariostrange · 2026-10-29