AI may crack other complexity problems before P vs NP, two users suggest
One post argues that “essentially zero direct progress” on proving P ≠ NP leaves advanced AI little to build on, unless P = NP.
TLDR
Two September 11, 2026 posts suggest that separating NP from L (log space), or BPP from NEXP, might be more tractable for AI than P vs NP. One also names P versus PSPACE as a possible nearer-term target. Their skepticism about P vs NP differs: one says it will remain beyond AI’s reach, while the other considers a resolution unlikely soon, arguing that “essentially zero direct progress” on proving P ≠ NP leaves even many advanced models little to work with unless P = NP.
Combined views
22.7K
6 Sources, first seen ago
