eigenrobot jokes: has anyone tried proving that proving P≠NP's independence from ZFC is itself independent
eigenrobot · x · 2026-11-22
eigenrobot poses a meta-level math joke: has anyone simply tried to prove that whether (dis)proving P=NP is independent of ZFC is itself independent of ZFC? A recursive riff on undecidability in computational complexity.
More from Fun
- Jason Calacanis shares a spooky shoulder-tap anecdote about Jensen Huang — ArmughanAA · 2026-11-22
- Stochastic parrot meme knocks on Riemann's door after 'solving' Erdős and Navier-Stokes — Kyrannio · 2026-11-22
- Winning fight robot gets kissed and its pilot signs autographs: "that's a real sport" — cixliv · 2026-11-22
- Gary Marcus locks comments, citing intellectual dishonesty as the market crash rages — GaryMarcus · 2026-11-22
- Welcome to the other side of the singularity: the intelligence explosion meme — rand_longevity · 2026-11-22
- A game studio 3D scene built entirely from 4,903 lines of code — techartist_ · 2026-11-22