Fortnow: P vs NP Beyond AI, but Other Complexity Questions May Fall

Theoretical computer scientist Lance Fortnow argues that P vs NP remains beyond AI's reach, but other complexity questions such as separating NP from L and BPP from NE are more tractable and may be solved with AI's help.

2026-09-11 ~ 2026-09-13 · 2 related posts

• Fortnow: P vs NP beyond AI's reach, but NP vs L separations could fall — fortnow · 2026-09-11
• Complexity theorists: P vs NP out of reach for AI, but L/NP and BPP/NEXP may fall soon — _onionesque · 2026-09-13