HackerTube / Video
SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
suckerpinch
Tom Murphy's satirical SIGBOVIK 2007 presentation, delivered under a pseudonym, proving that generalized Super Mario Bros. is NP-complete. It is a short, deadpan take on a complexity theory result.
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
4 Hacker News mentions · 2013–2021