Skip to content
HHackerTube.videoSurprise me

Great Impractical Ideas in Computer Science: PowerPoint Programming

Great Impractical Ideas in Computer Science: PowerPoint Programming on HackerTube: recommended by 4 Hacker News commenters across 4 separate months, 2020–2026.

Tom Wildenhain

lecture · intermediate · evergreen

Open on YouTube

Tom Wildenhain's guest lecture for CMU's Esoteric Programming Languages course shows that PowerPoint transitions and slides are Turing complete without macros, building up to a mind-bending fractal ending.

Why Hacker News recommends it

Repeatedly recommended in best-talks threads as a fun, mind-blowing demonstration of unexpected computation.

people recommended it
4
separate months
4
strong recommendations
2
discussed on HN
2020–2026
“Strong recommend!”
— gregsadetsky, Dec 2020, in “Ask HN: Best Talks of 2020?”

What HN commenters said

5 Hacker News comments link this video. Each one links back to its thread.

gnatmanDec 2023Strongly recommends

"Great Impractical Ideas in Computer Science: PowerPoint Programming" Tom Wildenham (2019) ▶ this video Really fun, kinda blew my mind. Guy got a job at Microsoft shortly after giving this talk.

in “Ask HN: Best tech talks you have heard in 2023?” · View on HN

gregsadetskyDec 2020Strongly recommends

I would also very highly recommend you watch this talk about PowerPoint’s Turing-completeness — ▶ this video It’s from the same person (Tom Wildenhain) as your video, but this is an hour long, there’s an actual audience (that’s supportive and spends most of the talk in disbelief), and the end with recursive slides / fractals is an absolute mind melt. Strong recommend! :) Thanks for the suggestions/reminder!

in “Ask HN: Best Talks of 2020?” · View on HN

jjmarrJul 2024Recommends

▶ this video PowerPoint programming by Tom Wildenhain. He does not use VBA macros, just shows that PowerPoint transitions and slides are Turing Complete.

in “Ask HN: What's the best YouTube lecture you've seen recently?” · View on HN

K0SM0SJan 2020Recommends

I think this drives your point with incredible wit: “On The Turing Completeness of PowerPoint (SIGBOVIK)” by Tom Wildenhain[1]. (5 minutes video) [1]: [link] (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) ▶ this video

in “The “No Code” Delusion” · View on HN

ndiddyMay 2026Cites it

Microsoft actually does a fairly good job with this. Here's a part of a talk that goes over a single feature in PowerPoint (a slide animation that morphs the contents of one slide into a different slide) and demonstrates how this feature interacts with the enormous existing PowerPoint feature set in interesting ways. ▶ this video It's obviously a stupid gimmicky feature but whatever team Microsoft put on it were clearly overachievers.

in “Photoshop's challenges with focus, pt. 2” · View on HN

Topics & tags

Computability & complexity theoryUniversity lectures & coursesProgramming language designpowerpointturing completenessesoteric languagescomputationcmu