SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
suckerpinch3 HN recommenders · recommended in 3 months, 2013-2021
84K views · 18 years ago · comedy · 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.
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
5:34On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
1.2M views • 9 years ago
10:44P vs. NP and the Computational Complexity Zoo
hackerdashery
3.7M views • 12 years ago
6:14Turing & The Halting Problem - Computerphile
Computerphile
919K views • 12 years ago
34:00Math's Fundamental Flaw
Veritasium
30.8M views • 5 years ago
42:3630 Weird Chess Algorithms: Elo World
suckerpinch
965K views • 7 years ago
13:14Did Nintendo really forget to Optimize Super Mario 64 ? | MVG
Modern Vintage Gamer
1.3M views • 6 years ago
57:03HACKENBUSH: a window to a new world of math
Owen Maitzen
562K views • 5 years ago
16:18Computer program that learns to play classic NES games
suckerpinch
2.2M views • 13 years ago
51:32Great Impractical Ideas in Computer Science: PowerPoint Programming
Tom Wildenhain
2.2M views • 7 years ago
5:58MarI/O - Machine Learning for Video Games
SethBling
11.5M views • 11 years ago
17:58What P vs NP is actually about
Polylog
253K views • 2 years ago
22:54I Built a COMPUTER in Magic: The Gathering
Because Science
2M views • 7 years ago
26:41Finding the BEST sine function for Nintendo 64
Kaze Emanuar
418K views • 3 years ago
1:06:43Scott Aaronson | How Much Math Is Knowable?
Harvard CMSA
58K views • 1 year ago
![Uppestcase and Lowestcase Letters [advances in derp learning]](https://i.ytimg.com/vi/HLRdruqQfRk/hq2.jpg)
24:13Uppestcase and Lowestcase Letters [advances in derp learning]
suckerpinch
477K views • 5 years ago
1:11Infinite Mario AI - Long Level
Robin Baumgarten
1.3M views • 17 years ago
46:22"Clojure in Unity 3D: Functional Video Game Development" by Ramsey Nasser and Tims Gardner
Strange Loop Conference
24K views • 12 years ago
19:08NaN Gates and Flip FLOPS
suckerpinch
314K views • 7 years ago
55:02GradIEEEnt half decent: The hidden power of imprecise lines
suckerpinch
391K views • 3 years ago
11:39The Unbeatable Game from the 60s: Dr NIM
Stand-up Maths
7.2M views • 10 years ago
4 comments from Hacker News
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
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: ▶ 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)
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