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

Why it was recommended

This guy is a genius and also freakin hilarious

Strong recommendationhotwire · Original2018-06

What it covers

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. It is for someone who already knows the basic terms and wants the next step.

Video details

Channel

suckerpinch

Length

4 min 22 sec

Year

2008

More in this topic

• Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
• 28c3: The Science of Insecurity
• "Propositions as Types" by Philip Wadler
• Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
• Math's Fundamental Flaw
• On The Turing Completeness of PowerPoint (SIGBOVIK)