On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain · 8 则 HN 推荐
视频问答
可以让 AI 解释当前片段，或总结整部视频。如果回答附有时间戳，点击即可跳到对应片段。
试着问：这里讲的是什么意思？
需要用 Google 登录。确认前可查看最多会扣除多少积分。
A short SIGBOVIK 2017 presentation by Tom Wildenhain showing that PowerPoint animations are Turing complete, with a working Turing machine built in slides. The talk is delivered deadpan as a serious research result.
HN 推荐的原因： HN repeatedly names it as one of the funniest and best talks, a favorite example of absurd computation.
“Nerding out should always be hilarious like that!” 阅读 HN 讨论 ↗