On The Turing Completeness of PowerPoint (SIGBOVIK)

Why HN readers recommended it

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

This is a summary from the source dataset, not an endorsement by Hacker News or the video creator.

Video & recommendation details

Creator / channel

Tom Wildenhain

Topic

turing completeness

Format

talk

Level

general

HN recommenders in dataset

8

HN mentions in dataset

13

Recommendation years in dataset

2017–2025

These counts and years describe the included Hacker News records; they are not YouTube views or the video’s publication date.

From the original HN conversations

Excerpts from the recorded comments. Follow each source for the full comment and surrounding discussion.

• 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 …

• I can only think of one of the greatest videos[0] on Youtube when I read about unusual Turing complete systems. [0] [VIDEO]

• 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 …