The 'prove P=NP, make no mistakes' prompt joke making the rounds
tallmetommy · x · 2026-11-22
tallmetommy shares a tongue-in-cheek prompt: 'prove the method answers every instance of an NP-complete problem correctly within a polynomial time bound. make no mistakes.' — tossing computational complexity's holy grail at an LLM as if it were just another ask.
More from Fun
- Founder Jokes That Nobody Can Spell His Company's Name "no aliae" — It's Just 'et al.' — eschadiol · 2026-11-22
- Satirical 'Association for Clanker Mathematics' announcement: Claude proves Riemann Hypothesis — basedjensen · 2026-11-22
- Atlantic writer mocks AI math hype: throw money at the machine and it's good at Number — inductionheads · 2026-11-22
- Joke: AI solved Riemann before it solved dating — Kyrannio · 2026-11-22
- Unemployment vlogger niche gets crowded as laid-off white-collar workers turn to YouTube — tinyfool · 2026-11-22
- 'Newtypes have appeared': the cyborg moment of humans plus models pushing frontiers — mrdrozdov · 2026-11-22