[Tom Wildenhain] 论PPT的图灵完备性 On The Turing Completeness of PowerPoint (SIGBOVIK)

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.

Why HN likes it: HN repeatedly names it as one of the funniest and best talks, a favorite example of absurd computation.

“Nerding out should always be hilarious like that!”