PowerPoint Animations Are Turing Complete

Tom Wildenhain · Talk · 6 min · 2017 · YouTube title: On The Turing Completeness of PowerPoint (SIGBOVIK)

Why it's here

HN repeatedly names it as one of the funniest and best talks, a favorite example of absurd computation.

What it covers

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.