Talks to Watch

SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete

84K views · May 11, 2008 · 4:22 · 3 HN recommenders · 4 mentions · discussed 2013–2021

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 points people here: HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.

“This guy is a genius and also freakin hilarious”HN comment, 2018

What Hacker News said 4

Strongly recommendshotwireJun 2018

“This guy is a genius and also freakin hilarious”

Hilarious talk from a genius presenter.

Full comment

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
Recommendsgroovy2shoesMay 2013

“The presentation is also entertaining”

Entertaining presentation of a satirical SIGBOVIK paper.

Full 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] this video

in “Classic Nintendo Games are NP-Hard” · view on HN
Recommendsdane-pgpNov 2021

“I have to include a link to his video”

Tom Murphy's proof that generalized Super Mario Bros. is NP-complete

Full 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": this video

in “Writing a Fuzzer for NES Games” · view on HN
Cites itikeboyMay 2016
Full comment

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)