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
- François Fleuret: Only Two Long-Term Futures — No Super AI, or Staying Fully Human With It — francoisfleuret · 2026-09-11
- IG reel debunking the 'winning the AI race against China' fallacy hits 500k likes — louisvarge · 2026-09-11
- Post-AI World Leaves No Room for Learning on the Job — rachittshah · 2026-09-11
- Researcher questions AI safety eval firm, citing 'blatantly sloppy' security and monitoring — Kyrannio · 2026-09-11
- AI researcher memes agent-swarm tinkering with He Jiankui's embryo-editing quote — dejavucoder · 2026-09-11
- nabla_theta: happy to be wrong if the AI utopia arrives with little ex ante risk — nabla_theta · 2026-09-11