SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
suckerpinch · 3 則 HN 推薦
影片問答
可以請 AI 解釋目前片段，或總結整部影片。如果回答附有時間戳記，點選即可跳到對應片段。
試著問：這裡講的是什麼意思？
需使用 Google 登入。確認前可查看最多會扣除多少點數。
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.
HN 推薦的原因： 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” 閱讀 HN 討論 ↗