complexity
4:22SIGBOVIK 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
3:23Hitler uses git
823K views • 15 years ago
ronopolis
A short parody clip in the 'Hitler learns about...' meme format, in which Hitler rants about git's confusing commands. It riffs on git's complexity and the Linus Torvalds and Facebook angle.
3:09Microservices
4M views • 6 years ago
KRAZAM
A short KRAZAM comedy sketch in which engineers explain an absurdly tangled microservices architecture to a manager. It parodies how backend complexity gets justified with jargon.