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
- Best Argument for Shorter Workweek is Arithmetic, Not Wellbeing — VraserX · 2026-08-18
- Davidad argues superintelligent AGI might treat humans well — danfaggella · 2026-08-18
- Microsoft VP: AI adoption is fundamentally a selective system of survival of the fittest — dfinke · 2026-08-18
- Opinion: The Optimal Profile Requires Core Skills Learned Without AI — connoraxiotes · 2026-08-18
- What counts as "itself" in recursive self-improvement? Drawing the system boundary — viborci · 2026-08-18
- Why I'm skeptical about the "Internet of Agents" rental market — MelodicCare1216 · 2026-08-18