SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
suckerpinch3 HN recommenders · recommended in 3 months, 2013–2021
comedy · intermediate · evergreen · 2013–2021 on HN
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.
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
Up next
7 mo on HNQuakeCon 2012 - John Carmack Keynote
QuakeCon Official
6 HN recommender · 2012–2018
8 mo on HNTech Talk: Linus Torvalds on git
Google
9 HN recommender · 2007–2023
3 mo on HNQuakeCon 2011 - John Carmack Keynote
QuakeCon Official
3 HN recommender · 2011–2018
2 mo on HNJohn Carmack Facebook Connect 2021 Keynote
UploadVR
4 HN recommender · 2021–2022
18 mo on HNRuby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
Confreaks
17 HN recommender · 2013–2026
9 mo on HN28c3: The Science of Insecurity
28c3
9 HN recommender · 2012–2024
8 mo on HN"Propositions as Types" by Philip Wadler
Strange Loop Conference
9 HN recommender · 2015–2026
7 mo on HNBreak Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
Adrian Crenshaw
6 HN recommender · 2017–2026
7 mo on HNMath's Fundamental Flaw
Veritasium
7 HN recommender · 2021–2024
6 mo on HNOn The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
8 HN recommender · 2017–2025
6 mo on HNLife in life
Phillip Bradbury
6 HN recommender · 2013–2025
5 mo on HNLambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript
Fullstack Academy
5 HN recommender · 2019–2024
4 comments from Hacker News
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: ▶ this video
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
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
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)