Donald Knuth: a proof of P=NP would almost surely be useless in practice
hugobowne · x · 2026-09-10
Donald Knuth argues that even if P=NP turns out to be true, the equality likely won't be helpful, because such a proof will almost surely be nonconstructive — offering no way to actually extract efficient algorithms from it.
More from Research
- ECCV 学者热议：AI 压缩研究多样性，但别把写作外包给它 — ducha_aiki · 2026-09-10
- Rumors swirl that OpenAI nears verified proof of the Hodge conjecture — josh_wills · 2026-09-10
- DeepSeek cites 2024 YoCo paper as inspiration behind its CED transformer blocks — jm_alexia · 2026-09-10
- Researchers argue Transformer encoder/decoder naming is just attention masks — TimDarcet · 2026-09-10
- Academic warnings: AI reduces research diversity but don't outsource writing — ducha_aiki · 2026-09-10
- MicroSLAM tops LaMaria benchmark, turning cheap egocentric video into robot training environments — lukas_m_ziegler · 2026-09-10