HackerTube / Video
On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
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.
13 Hacker News mentions · 2017–2025