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

suckerpinch · 83.6K views · 2008-05-11 · 4:22

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

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.

On Hacker News

HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.

Recommended by 3 HN people across 3 months · HN mentions 2013–2021

Topics

Computability & complexity theory Satire & parody

What people said

hotwire · 2018-06 · Strong recommendation
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: [VIDEO]
Read the original HN comment ↗

dane-pgp · 2021-11 · Recommendation
If we're sharing awesome Mario-related work by Tom Murphy, I have to include a link to his video "Generalized Super Mario Bros. is NP-Complete": [VIDEO]
Read the original HN comment ↗

groovy2shoes · 2013-05 · Recommendation
Any time I see papers like this, I'm reminded of Vargomax V. Vargomax's classic SIGBOVIK 2007 paper [1]. The presentation is also entertaining [2]. [1] [LINK] [2] [VIDEO]
Read the original HN comment ↗

Sources

Video by suckerpinch, played through YouTube.

HN Library · Source license

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks

SaaS & AI candidates: Topic keywords do not match
Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources