hackertube.io

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

suckerpinch · comedy · Watch on YouTube

Computability & complexity theorySatire & parody

What it is

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 Hacker News recommends it

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

  • 3 people recommended it
  • 3 different months
  • 1 strong recommendations
  • first 2013, last 2021

What HN commenters said

  1. “This guy is a genius and also freakin hilarious”

    Hilarious talk from a genius presenter.

    hotwire, 2018-06 · Strong recommendation · in “A general technique for automating NES games (2013)”

  2. “The presentation is also entertaining”

    Entertaining presentation of a satirical SIGBOVIK paper.

    groovy2shoes, 2013-05 · Recommendation · in “Classic Nintendo Games are NP-Hard”

  3. “I have to include a link to his video”

    Tom Murphy's proof that generalized Super Mario Bros. is NP-complete

    dane-pgp, 2021-11 · Recommendation · in “Writing a Fuzzer for NES Games”

Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.

Topics: np-complete, super mario bros, sigbovik, complexity theory, satire

Also recommended by the same people