On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain · 8 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
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.
Why HN recommends it: 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!” Read on HN ↗