“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

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
“This guy is a genius and also freakin hilarious”
Hilarious talk from a genius presenter.
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: this video
“The presentation is also entertaining”
Entertaining presentation of a satirical SIGBOVIK paper.
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
“I have to include a link to his video”
Tom Murphy's proof that generalized Super Mario Bros. is NP-complete
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)