P≠NP won't be proved soon, but AI could speed the needed literature 100x
rrwilliams · x · 2026-11-23
rrwilliams' second scenario: even with AI acceleration, P≠NP almost certainly won't be proved soon. Easier separations like P≠PSPACE or LOGSPACE≠NP must fall first (barely any progress), and circuit lower bounds are further out — prove SAT of length L has no L^1.01-size circuits first. He believes AI will speed up building that thin literature by orders of magnitude.
Related event: Ryan Williams lays out three scenarios for P vs NP(4 posts)→
More from AGI Musings
- User asks Anthropic to publish a full human-agent trace of solving a Millennium Prize problem — _arohan_ · 2026-11-23
- LeCun cites Socrates' opposition to writing to counter AI capability worries — ylecun · 2026-11-23
- ENIGMA Q&A: Why Open Datasets Made Alzheimer's AI Classification Nearly Solved — PTenigma · 2026-11-23
- Mustafa Suleyman and Yuval Harari discuss AI, consciousness and humanity — krishnan · 2026-11-23
- Polymarket: Only 10% odds US enacts AI safety bill by end of 2026 — Polymarket · 2026-11-23
- OpenAI Chief Scientist warns AI could spark 'avalanche' of breakthroughs by 2027 — Polymarket · 2026-11-23