Fortnow: P vs NP beyond AI's reach, but NP vs L separations could fall
fortnow · x · 2026-09-11
Theoretical computer scientist Lance Fortnow argues that P vs NP will remain out of AI's reach, but other complexity problems—like separating NP from L (log space) or BPP from NEXP—might be more tractable and would still make an incredible splash. His point suggests more realistic targets for AI-assisted mathematics than the classic open problem.
More from Research
- GEVIBench launches as a comprehensive benchmark for comparing voltage indicators — drmichaellevin · 2026-09-11
- Gaussian Light Transport: 13D Gaussian Mixtures Speed Up Global Illumination — ssh4net · 2026-09-11
- Llama Loves Pirates — Goodfire's Tom McGrath on teaching math without the pirate style — Machine Learning Street Talk · 2026-09-11
- MaP-WAM tackles non-Markovian robot manipulation with memory-grounded planning — Sizhe Zhao · 2026-09-11
- Negative Self-Distillation improves LLM reasoning by avoiding flawed reasoning paths — Rongcan Pei · 2026-09-11
- DeepMind-led paper makes design docs the source of truth, code disposable — SMART regenerates in 1.5-3h for ~$100 — Roger_M_Taylor · 2026-09-11