On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain8 HN recommenders · 2017–2025
1.2M views · talk · evergreen · Uploaded 2017-04-01
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.
HN repeatedly names it as one of the funniest and best talks, a favorite example of absurd computation.
53:22Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
Confreaks
51:22USENIX Security '18-Q: Why Do Keynote Speakers Keep Suggesting That Improving Security Is Possible?
USENIX
2:58The Loving Trap
Ben Woodhams
59:2328c3: The Science of Insecurity
28c3
42:43"Propositions as Types" by Philip Wadler
Strange Loop Conference
46:19Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
Adrian Crenshaw
19:08NaN Gates and Flip FLOPS
suckerpinch
34:00Math's Fundamental Flaw
Veritasium
13 comments from Hacker News
Since PowerPoint was proven to be Turing complete my bet is on it and not Excel being the most commonly used: [VIDEO]
On The Turing Completeness of PowerPoint [VIDEO] Compiling C to printable x86, to make an executable research paper [LINK] HDR Photography in Microsoft Excel?! [LINK] Zebras All the Way Down [LINK] Solving Layout Problems with CSS Grid and Friends [LINK] Console Security - Switch [LINK] Let's move SMM out of firmware and into the kernel [LINK] Bringing Linux back to server boot ROMs with NERF and Heads [LINK] Sharing the Chisel [LINK] (looks like the actual conference video wasn't released)
This is very similar in style to my favorite presentation and paper of all time, titled On The Turing Completeness of PowerPoint [0]. The research, presentation and paper were all created inside of powerpoint and it is probably the greatest thing ever made. If you enjoyed the above video you will definitely enjoy this. [0] [VIDEO]
The former paper appeared in SIBVOIK 2017 ( [LINK] ), where you can find other such papers. My personal favorites are "On The Turing Completeness of PowerPoint" ( [VIDEO] ) and "Automated Distributed Execution of LLVM code using SQL JIT Compilation" > Following the popularity of MapReduce, a whole ecosystem of Apache Incubator Projects has emerged that all solve the same problem. Famous examples include Apache Hadoop, Apache Spark, Apache Pikachu, Apache Pig, German Spark and Apache Hive [1]
I can only think of one of the greatest videos[0] on Youtube when I read about unusual Turing complete systems. [0] [VIDEO]
Someone created a bf interpreter using this game: [LINK] Also of interest may be similar attempts to create computers in other games and applications: OpenTTD: [LINK] Minecraft: [LINK] PowerPoint: [VIDEO]
Reminds me of a related project presented at SIGBOVIK demonstrating the Turing completeness of PowerPoint. It is also art. [VIDEO]
I believe I saw something that said CSS is Turing Complete* * Only with user interaction to step things along, similar to powerpoint: [VIDEO]
For another completely insane but kind of fun way to abuse an office application, see "On The Turing Completeness of PowerPoint" [1]. (Gwern has a whole list of accidentally/surprisingly turing-complete things at [2]) 1. [VIDEO] 2. [LINK]
TeX is not a "language"; it's just a tool for typesetting when you want to go the last mile of achieving book-quality printing. The fact that it turns out to be possible to (ab)use its macros (originally designed merely to save the user some typing effort) to do "programming" shows only that it's easy for things to become "accidentally Turing complete" [1], and the cleverness/perversity of its user community. > TeX was designed for typesetting, not for programming; so it is at best “weird” when considered as a programming language. — DEK, Digital Typography , page 235 > In some sense I put in many of TeX's programming features only after kicking and screaming. — DEK, Digital Typography , page 648 > So TeX is a programming language but I had to put in those features kicking and screaming. […] In a way I resent having every language be universal because they’ll be universal in a different way. […] I was really thinking of TeX as something that the more programming it had in it, the less it was doing its real mission of typesetting. When I put in the calculation of prime numbers into the TeX manual I was not thinking of this as the way to use TeX. I was thinking, “Oh, by the way, look at this: dogs can stand on their hind legs and TeX can calculate prime numbers.” — DEK, interviewed in Peter Seibel's Coders at Work > Michael Plass, who was Don's student and worked with Don on TeX, told me once that "Don tried very hard not to make TeX a programming language. Unfortunately, he di
I think this drives your point with incredible wit: “On The Turing Completeness of PowerPoint (SIGBOVIK)” by Tom Wildenhain[1]. (5 minutes video) [1]: [VIDEO] (Nerding out should always be hilarious like that!) [2]: Recording of a guest lecture he gave for the Esoteric Programming Languages course at CMU. (~1h) [LINK]
If you liked the Game of Life running a Game of Life simulation you might enjoy the YT video[0] showing someone's functioning raycasting engine within the game world of Factorio using thousands of machines and parts provided by the game. It blew my mind. What I also found quite amusing was the PowerPoint presentation demonstrating the Turing-completeness of PowerPoint animations[1]. I'll never get tired of this kind of tinkering walking the line between genius and a healthy portion of crazy. [0] [LINK] [1] [VIDEO]
Based on important research like [VIDEO] , it should definitely be possible to generate a .pptx that will run Windows inside of an emulator inside PowerPoint slides. That HTML file is lying to you!