On The Turing Completeness of PowerPoint (SIGBOVIK)
1,229,622 views
About this video
Advanced · Hand-picked by a BrighterTube curator · found via HackerTube (Karpathy's dataset of videos Hacker News recommendsBuilds a working Turing machine out of PowerPoint animations and triggers, demonstrating Turing completeness in the least likely software imaginable; a deadpan SIGBOVIK short that makes a computability idea genuinely concrete.
Tom Wildenhain builds a Turing machine from PowerPoint animations, showing what Turing completeness means.
Video by Tom Wildenhain, played through YouTube's embedded player.