HackerOn The Turing Completeness of PowerPoint (SIGBOVIK)
Tom WildenhainYouTube ↗
Further reading 2
What can a language express, and what can it guarantee? →Factorial can be written without naming the function. That trick raises a harder question: if every program must terminate, can unrestricted recursion be allowed? Take that distinction into slides, libraries and language extensions.This video helps answer · Can presentation slides perform general computation?When does input become an instruction? →A typo can still be valid code. A data format can turn out to express computation. Follow an input inward and identify who decides how to interpret it.This video helps answer · When does an expressive format become an attack surface?
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