Scott Aaronson says AI theorem proofs do not mean P vs NP is around the corner
fortnow · x · 2026-07-21
Scott Aaronson reminds readers that a new theorem proved by AI does not mean P vs NP is about to be solved. The point is simply that progress in theorem proving should not be overinterpreted as a breakthrough on one of computer science’s hardest open problems.
More from AGI Musings
- Anti-AI content is algorithm gold and very profitable, quips commentator — annetgriffin · 2026-10-26
- Silicon Valley breakdown: five Stanford-area giants worth ~$18T — FinanceYF5 · 2026-10-26
- Anthropic says Claude leads 26% of its AI R&D — but self-improvement still has limits — Exponential View (Azeem Azhar) · 2026-10-26
- Humanoids shattered forecasts: half-marathon record in 2026, 100m faster than Bolt — ben_j_todd · 2026-10-26
- Stephen Casper on podcast: what if AI becomes a parasitic peer species in cyberspace — StephenLCasper · 2026-10-26
- Behind the EMNLP keynote: LMs as simulated learners to generate child language acquisition hypotheses — najoungkim · 2026-10-26