On The Turing Completeness of PowerPoint (SIGBOVIK)
8 人推荐 · 跨 6 个月 · 2017–2025
中文导读
Tom Wildenhain 在 SIGBOVIK 2017 上的硬核恶搞演讲。他一脸严肃地证明了 PowerPoint 的动画系统具备图灵完备性（Turing complete），并现场用幻灯片搭建出了一台真正可运行的图灵机。
为什么 HN 推它
被 HN 网友反复评为最搞笑也最惊艳的演讲之一，堪称“荒诞计算”（absurd computation）领域的快乐源泉与极客典范。
「极客钻牛角尖就该是这种让人捧腹大笑的劲头！」HN 网友原话：Nerding out should always be hilarious like that!
英文原摘要（HackerTube / Claude 整理）
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 repeatedly names it as one of the funniest and best talks, a favorite example of absurd computation.
HN 上的提及
Since PowerPoint was proven to be Turing complete my bet is on it and not Excel being the most commonly used
On The Turing Completeness of PowerPoint
it is probably the greatest thing ever made.
My personal favorites are
I can only think of one of the greatest videos[0] on Youtube