HackerTube

computability

Comedy×Play all on YouTube
No strong matches for “computability”. Here are the closest videos.
SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete4:22

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

84K views • 18 years ago
suckerpinch
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.
Topic match · Computability & complexity theory