Great Impractical Ideas in Computer Science: PowerPoint Programming
Tom Wildenhain4 HN recommenders · recommended in 4 months, 2020-2026
2.2M views · 7 years ago · lecture · evergreen
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.
Repeatedly recommended in best-talks threads as a fun, mind-blowing demonstration of unexpected computation.
5:34On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
1.2M views • 9 years ago
1:00:341. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare
626K views • 5 years ago
42:43"Propositions as Types" by Philip Wadler
Strange Loop Conference
143K views • 11 years ago
10:44P vs. NP and the Computational Complexity Zoo
hackerdashery
3.7M views • 12 years ago
1:02:34MIT Godel Escher Bach Lecture 1
jasonofthel33t
557K views • 13 years ago
6:14Turing & The Halting Problem - Computerphile
Computerphile
919K views • 12 years ago
1:12:56Lecture 1A | MIT 6.001 Structure and Interpretation, 1986
MIT OpenCourseWare
995K views • 17 years ago
17:26Lecture 1 | Programming Paradigms (Stanford)
Stanford
1.2M views • 18 years ago
1:07:22Invited Talk - Guy Steele
ClojureTV
39K views • 9 years ago
12:56Stephen Wolfram's Introduction to the Wolfram Language
Wolfram
924K views • 12 years ago
58:22Lecture 1B | MIT 6.001 Structure and Interpretation, 1986
MIT OpenCourseWare
116K views • 17 years ago
34:00Math's Fundamental Flaw
Veritasium
30.8M views • 5 years ago
1:12:56Lecture 1A: Overview and Introduction to Lisp
MIT OpenCourseWare
420K views • 7 years ago
59:04On the Expressive Power of Programming Languages by Shriram Krishnamurthi [PWLConf 2019]
PapersWeLove
27K views • 7 years ago
10:00SICP / What is "Computer Science" ?
LarryNorman
131K views • 20 years ago
1:02:15Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript
Fullstack Academy
227K views • 9 years ago
59:03Breaking Down Programming Paradigms: APL's Surprising Learning Curve // Aaron Hsu // Dyalog '17
Dyalog User Meetings
7K views • 9 years ago
1:04:45Stanford Seminar - Concatenative Programming: From Ivory to Metal
Stanford Online
14K views • 8 years ago
1:09:38"How to Think about Parallel Programming: Not!" - Guy L. Steele Jr. (Strange Loop 2010)
Strange Loop Conference
9K views • 5 years ago
59:2328c3: The Science of Insecurity
28c3
42K views • 14 years ago
5 comments from Hacker News
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.
▶ this video PowerPoint programming by Tom Wildenhain. He does not use VBA macros, just shows that PowerPoint transitions and slides are Turing Complete.
"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.
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!
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