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.

Original post →

More from Fun

Fun channel →