On The Turing Completeness of PowerPoint (SIGBOVIK)

Tom WildenhainLength: 6 minutesComputability & complexity theory

In brief

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.