Skip to content
hackertubeai

suckerpinch

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

About this video

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.

Keep your curiosity going.

A few more ideas from the same corner of the archive.

Vectors | Chapter 1, Essence of linear algebra

3Blue1Brown

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

But what is the Fourier Transform? A visual introduction.

3Blue1Brown

But what is a neural network? | Deep learning chapter 1

3Blue1Brown