Complexity theorists: P vs NP out of reach for AI, but L/NP and BPP/NEXP may fall soon
_onionesque · x · 2026-09-13
- The thread builds on Lance Fortnow's take: P vs NP will remain beyond AI's reach, but other complexity separations—NP from L (log space), BPP from NEXP—are more tractable and would still make an enormous splash if resolved.
- Robert Williams adds that there has been essentially zero direct progress on P≠NP, so even 10k parallel frontier models have little to work with unless P=NP; he expects L/NP, BPP/NEXP, and P/PSPACE to fall "not long from now."
Related event: Fortnow: P vs NP Beyond AI, but Other Complexity Questions May Fall(2 posts)→
More from AGI Musings
- 'AI bubble bursting': CEO slowdown messaging may trigger Monday crash, user warns — SumitGup · 2026-09-13
- Scobleizer dissects AI engagement bait: a thread claiming Altman, Amodei and Musk agreed to slow frontier models — Scobleizer · 2026-09-13
- AI companies born from safety fears keep 'succumbing to capitalism', thread argues — birchlse · 2026-09-13
- What domain expertise still can't be trusted to Claude or ChatGPT? — sartomiki · 2026-09-13
- Circuit complexity is stuck — and AI could be the perfect adversarial partner to crack it — _onionesque · 2026-09-13
- OpenAI Researcher Warns AI-Driven Military Power Will Concentrate in Frontier Labs — jachiam0 · 2026-09-13