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 討論 ↗