hotwireJun 2018Strongly recommends
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: ▶ this video
in “A general technique for automating NES games (2013)” · View on HN
SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete on HackerTube: recommended by 3 Hacker News commenters across 3 separate months, 2013–2021.
suckerpinch
Open on YouTubecomedy · intermediate · evergreen
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 Hacker News recommends it
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
- people recommended it
- 3
- separate months
- 3
- strong recommendations
- 1
- discussed on HN
- 2013–2021
“This guy is a genius and also freakin hilarious”
What HN commenters said
4 Hacker News comments link this video. Each one links back to its thread.
dane-pgpNov 2021Recommends
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
in “Writing a Fuzzer for NES Games” · View on HN
groovy2shoesMay 2013Recommends
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
in “Classic Nintendo Games are NP-Hard” · View on HN
ikeboyMay 2016Cites it
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)
in “TrackMania is NP-complete” · View on HN
Topics & tags
Computability & complexity theorySatire & parodynp-completesuper mario brossigbovikcomplexity theorysatire