Intuition: P≠NP would likely be O(n^logn) avg-case and practically useless
tokenbender · x · 2026-11-22
tokenbender shares his intuition on P vs NP: even if we prove P≠NP, the result would likely be something like O(n^logn) average-case runtime—still computationally infeasible in practice.
He predicts a hollow feeling would follow: gaining the knowledge while it leaves us unaffected.
More from Fun
- Stochastic Parrot meme: AI walks past Erdős and Riemann toward P=NP — pickover · 2026-11-22
- One chef, multiple auto stir-fry machines: automated wok kitchen goes viral — churchkey · 2026-11-22
- DHH's Omarchy group chat on X surpasses 500 members, with Grok reading messages — mark_k · 2026-11-22
- LiveOverflow on AI vulnerability discovery: 'I wish I had asked years ago — too late now' — rez0__ · 2026-11-22
- teortaxesTex mocks BAP's doomer AI forecast: "BAP is in his doggy era" — teortaxesTex · 2026-11-22
- Writing works subconsciously: metaphors, ambiguity, and how LLMs read like pond reflections — erikphoel · 2026-11-22