On The Turing Completeness of PowerPoint (SIGBOVIK)

Why it was recommended

Nerding out should always be hilarious like that!

Strong recommendationK0SM0S · Original2020-01

What it covers

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. It is for a general viewer who does not plan to take a prerequisite first.

Video details

Channel

Tom Wildenhain

Length

5 min 34 sec

Year

2017

More in this topic

• Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
• 28c3: The Science of Insecurity
• "Propositions as Types" by Philip Wadler
• Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
• Math's Fundamental Flaw
• Life in life