
suckerpinch
3 HN recommenders · recommended in 4 months, 2013–2021
4:22 · 84K views · May 11, 2008
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 comments from Hacker News
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: this video
Any time I see papers like this, I'm reminded of Vargomax V. Vargomax's classic SIGBOVIK 2007 paper [1]. The presentation is also entertaining [2]. [1] [LINK] [2] this video
If we're sharing awesome Mario-related work by Tom Murphy, I have to include a link to his video "Generalized Super Mario Bros. is NP-Complete": this video
Similar examples: [LINK] [LINK] [LINK] [LINK] [LINK] this video [LINK] [LINK] [LINK] [LINK] [LINK] (Generated by going through HN search results for Turing complete and NP complete)