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 讨论 ↗