SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
Channel:suckerpinch · Length:4:22 · Published:2008-05-11 · Views:83675
Summary
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 HN recommends it
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, 2018
Computability & complexity theory · Satire & parody
Subtitles (excerpt)
hello mine is Vargo Max V Vargo Max and my paper is General Super Mario Bros is NP complete I am sorry I have not come in the Sig bovic I can very stuck let me tell that my work it is about Super Mario face and horses many beards have spent grants to categorization a game into complexity class for example Tetris is a NP or chess is a p space Etc however many famous 1985 game from Japan have been left in dusts or Wayside which in a kind of class discrimination in this paper I'm to show help up this 1984 game Super Mario Bros which about one or two Bros that land in Fantasy Life with proof of NP complete Jumpman on a brick now I tell you to Super Mario Bros is the this which made by Nintendo company for family computer 8 Bits Super Mario Bros is star two Plum Bobs named Luigi with Mario man here is a picked of Mario man because Super Mario Bros in a 8 Bits family computer its limited screen to 32 * 32 bricks for shown it is in complexity class not possible to complete the first step is generalized it we say now that fantasy land is size Infinity time Infinity inity brick this mean that Mario man can had a very large house or a castle to prove a theory generally sized Super Mario Brothers is not possible to complete
On Hacker News
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: [VIDEO] — hotwire, 2018-06
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": [VIDEO] — dane-pgp, 2021-11
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] [VIDEO] — groovy2shoes, 2013-05
Similar examples: [LINK] [LINK] [LINK] [LINK] [LINK] [VIDEO] [LINK] [LINK] [LINK] [LINK] [LINK] (Generated by going through HN search results for Turing complete and NP complete) — ikeboy, 2016-05
Related videos
- QuakeCon 2012 - John Carmack Keynote · QuakeCon Official · 3:36:38
- Tech Talk: Linus Torvalds on git · Google · 1:10:15
- QuakeCon 2011 - John Carmack Keynote · QuakeCon Official · 1:26:38
- John Carmack Facebook Connect 2021 Keynote · UploadVR · 1:01:32
- Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich · Confreaks · 53:21
- USENIX Security '18-Q: Why Do Keynote Speakers Keep Suggesting That Improving Security Is Possible? · USENIX · 51:22
- The Loving Trap · Ben Woodhams · 2:58
- 28c3: The Science of Insecurity · 28c3 · 59:23
- "Propositions as Types" by Philip Wadler · Strange Loop Conference · 42:43
- Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas · Adrian Crenshaw · 46:19
- NaN Gates and Flip FLOPS · suckerpinch · 19:07
- Math's Fundamental Flaw · Veritasium · 33:59
- Erlang The Movie II: The Sequel · gar1t · 9:55
- On The Turing Completeness of PowerPoint (SIGBOVIK) · Tom Wildenhain · 5:33
- Chicken chicken chicken · Yoram Bauman · 4:06
- Life in life · Phillip Bradbury · 1:30