SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
suckerpinch · 3 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
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” Read on HN ↗