On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom WildenhainYouTube ↗
Further reading 2
Can presentation slides perform general computation? →Compare a deliberately minimal interpreter with a surprising construction inside slides. The decisive question is which operations the system can express.When does an expressive format become an attack surface? →A format can admit computation its designer did not anticipate. That changes what it means to process input supplied by someone else.
Caption notes
Hyperlinks, animations and manual clicks turn a PowerPoint deck into a Turing machine. The demonstration separates computational expressiveness from practical speed.
Original passages · 5
This is implemented completely with animations. There are no macrosevery other area is blocked. So I can click randomly essentiallyessentially imitate any transition function of any other touring machineyou can solve every computational problem with a dedicated PowerPoint fileThe user has to click on each orange region