On The Turing Completeness of PowerPoint (SIGBOVIK)

Name: On The Turing Completeness of PowerPoint (SIGBOVIK)
Uploaded: 2017-04-01T00:00:00.000Z
Duration: 5 min 33 s
Description: PowerPoint is Turing-complete — Tom demonstrates a working Turing machine built purely with hyperlinks and animations that can simulate any Turing machine, proving PowerPoint can solve any computational problem.

Tom Wildenhain · 5:33 · Watch on YouTube

PowerPoint is Turing-complete — Tom demonstrates a working Turing machine built purely with hyperlinks and animations that can simulate any Turing machine, proving PowerPoint can solve any computational problem.

Read the full summary on retube

한국어