On The Turing Completeness of PowerPoint (SIGBOVIK)
1.2M views • 9 years ago
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.
Topic match · Computability & complexity theory