HackerTubeHN

talk · HACKER NEWS RECOMMENDATION

On The Turing Completeness of PowerPoint (SIGBOVIK)

Tom Wildenhain · 8 HN recommenders · 6 recommendation months

YouTube

Recommended by 8 Hacker News commenters across 6 months (2017–2025).

SignalTube analysis

Among 7 other talk videos tagged Computability & complexity theory, the mean is 7.3 distinct HN recommenders. This video has 8 distinct HN recommenders, close to that mean. Recommendations span 6 distinct months; the peer average is 7.4 months. This is a data-derived comparison, not a human review or quality rating.

62% of its 13 labeled comments are marked as recommendations or strong recommendations. HN mention years are 2017–2025; those years describe discussion history, not upload date. A verified runtime is not present in the current metadata snapshot. A verified YouTube publication date is not present in the current metadata snapshot.

Channel / speaker
Tom Wildenhain
Verified runtime
Not verified in the current YouTube metadata
YouTube upload date
Not verified
Hacker News mention years
2017–2025

SAME TOPIC AND FORMAT

Compare with related videos

7 peers

The comparison cohort uses other talk videos in Computability & complexity theory. “Shared recommenders” counts HN users who recommended both videos in the source graph.

VideoHN recommendersRecommendation monthsPositive label shareShared recommendersRuntimeUpload date
On The Turing Completeness of PowerPoint (SIGBOVIK)Current video8662%—Not verified in the current YouTube metadataNot verified
Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirichtalk · Confreaks171890%No recorded overlapNot verifiedNot verified
28c3: The Science of Insecuritytalk · 28c39969%No recorded overlapNot verifiedNot verified
"Propositions as Types" by Philip Wadlertalk · Strange Loop Conference9845%No recorded overlapNot verifiedNot verified

THREE SOURCE-BASED CONTEXT POINTS

Why Hacker News recommends it

13 mentions

Each note combines the dataset’s stance label and short rationale; comment bodies are not reproduced. Open the HN source for the original discussion.

The archive classifies this as a joke in “Show HN: AnydocAI – Every file exists as all file types”. Its short rationale: the source snapshot has no short rationale for this mention.

The archive classifies this as a recommendation in “Ask HN: Best Talks of 2020?”. Its short rationale: Amusing demonstration of PowerPoint animations being Turing-complete.

strong rec2020-01Original HN comment ↗

The archive classifies this as a strong recommendation in “The “No Code” Delusion”. Its short rationale: Witty five-minute talk on PowerPoint's Turing completeness.