3 HN users recommended this comedy video3 months2013–2021score 3.5
Years with an HN recommendation, 2007–2026
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
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.
“This guy is a genius and also freakin hilarious” (HN, 2018)
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]
Entertaining presentation of a satirical SIGBOVIK paper.
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]
Tom Murphy's proof that generalized Super Mario Bros. is NP-complete
Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.
Plays via YouTube's privacy-enhanced embed
4 Hacker News comments
From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.
Citations, criticism and jokes