If P=NP, proving it would be exactly what AI is good at: unleash agents to find polynomial solutions
soumitrashukla9 · x · 2026-09-11
A clever quip making the rounds: proving P≠NP might be hard for AI, but if P=NP, proving that is precisely what AI excels at — just send a gazillion agents hunting for polynomial-time solutions to NP-complete problems. The author jokes about hoping this doesn't destroy cryptography as we know it.
More from Fun
- Mr Bean in Game of Thrones: an AI-generated video mashup — BrashProd · 2026-09-11
- The New Apple Watch Has 4GB of RAM — As Much Storage as the Original iPhone — signulll · 2026-09-11
- GPT-6 Astra talks to Muse agent to spin up a Tailscale bridge into Things 3 — SeanOliver · 2026-09-11
- Users Say Astra Got Dumber Post-Launch, Failing Even Simple Session Reading — koltregaskes · 2026-09-11
- 'AI Hell': Even Shower Time Now Comes With ChatGPT Shareholder-Value Brainstorms — user83726169 · 2026-09-11
- Instead of "I'm busy," this user now says "please standby" — shakoistsLog · 2026-09-11