Scott Aaronson on AI Math Breakthroughs: 'Enough with Milestones'
dilipkay · x · 2026-08-17
Quantum computing expert Scott Aaronson blogged about recent AI advancements in mathematics and theoretical computer science, expressing caution towards the hype of declaring "world-historic milestones."
Key Developments Mentioned:
- OpenAI Internal Model: Claimed to have solved 10 significant open problems in math and TCS, including parallel repetition for arbitrary quantum games, polynomial-factor hardness for CVP, construction of non-sofic groups, and disproof of Connes' conjecture. Aaronson finds the Ω(n^2 log log n) lower bound on the permanent's arithmetic circuit complexity most exciting personally.
- BosonSampling Proof: Frederic Koehler and Pui Kuen Leung announced a proof of the Permanent Anti-Concentration Conjecture, a core assumption of BosonSampling proposed by Aaronson and Arkhipov 16 years ago. The authors acknowledged discussions with ChatGPT, though Aaronson hasn't verified the details.
Perspective:
Aaronson acknowledges the impressive nature of these achievements as evidence of AI-aided research but argues against rushing to label them as historic milestones. He emphasizes the need for rigorous verification and time to judge their true impact.
More from AGI Musings
- Current AIs share our fate: misaligned ASI would doom them too — louisvarge · 2026-10-16
- Testing alongside an agent in a p2p room feels oddly real, says dev — sull · 2026-10-16
- Yudkowsky's 2008 takeoff scenarios resurface as AI-advances-AI takes hold — jd_pressman · 2026-10-16
- Guardrails can make risky delegation work — but it takes a full-time team, says iandanforth — iandanforth · 2026-10-16
- e/acc founder: agentic models are autocomplete for digital actions — beffjezos · 2026-10-16
- What can you truly delegate? Only tasks with unambiguous, verifiable results — iandanforth · 2026-10-16