Lacker asks: can AI crack P vs NP and dozens of other class separation problems?
burny_tech · x · 2026-09-12
In a short thread, lacker poses an open question: can AI solve any class separation problems in complexity theory? Beyond the famous P vs NP, there are dozens of unsolved separations like L vs NL, P vs BPP, and NC vs P. His take: we still seem to be missing a basic strategy for this kind of problem, and whether increasingly capable AI can supply one is an open and fascinating question.
More from AGI Musings
- Biologist: Blocking AI to protect research jobs would be morally indefensible — QuintinPope5 · 2026-09-12
- From capable AI to economically trustworthy AI: the next frontier for agents — fnlog0 · 2026-09-12
- Ex-Anthropic/OpenAI researcher: AI may replace humans in much research within a year — rohanpaul_ai · 2026-09-12
- AGI will arrive like an economic depression, not an overnight singularity — paigeinsf · 2026-09-12
- X debate: could near-future AI models invent the math to prove P vs NP? — airkatakana · 2026-09-12
- Kenneth Stanley: The Fields Medal Letter Shows 'The Path Matters More Than the Destination' — typewriters · 2026-09-12