HackerTube.runGood videos, with context.
SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
About this video
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.
Why it appears in the archive
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
AI-generated summary and labels from the source dataset; verify important details against the video. Source & credits.
From the Hacker News discussion
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: [VIDEO]
Read original comment ↗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] [VIDEO]
Read original comment ↗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": [VIDEO]
Read original comment ↗Similar examples: [LINK] [LINK] [LINK] [LINK] [LINK] [VIDEO] [LINK] [LINK] [LINK] [LINK] [LINK] (Generated by going through HN search results for Turing complete and NP complete)
Read original comment ↗