Proving P=NP in One Joke: Using Codex as a Polynomial Solver
mgostIH · x · 2026-08-03
A user humorously "proved" the Millennium Prize Problem P=NP with a short piece of pseudo-logic:
> Since a problem belongs to NP if it can be verified in polynomial time, we can just ask Codex (the AI coding assistant) to solve it by using that verifier.
This witty take on using AI's automated coding capabilities to "brute-force" complex problems resonated with geeks familiar with AI code generation limits.
More from Fun
- The Dilemma of Science Podcasts: 'Macro Trends' vs. 'Experimental Details'? — ziv_ravid · 2026-08-03
- Ethan Mollick on the Marvel of LLMs Met with 'Ugh, Another Bot' — emollick · 2026-08-03
- Blind User Shares How ChatGPT Became a Life Changer for Document Formatting — groovinhighness · 2026-08-03
- Public Reacts to AI Math Breakthroughs with Zero-Sum Hostility Towards Mathematicians — tszzl · 2026-08-03
- Parody: Hank Green Apologizes for Using the Printing Press (1450) — AdrienLE · 2026-08-03
- User Praises Fable 5: More Reliable Than Most Human Coworkers — daniel_mac8 · 2026-08-03