Tom Wildenhain developed a Turing-complete punchcard-driven universal machine that is embodied entirely in Powerpoint Animations and can execute any arbitrary code (albeit very slowly) and presented it at CMU's SIGBOVIK 2017 conference to great hilarity.
Turing Completeness is one of my favorite everyday miracles. While it took hundreds of years to get from Ada Lovelace to the first fully programmable machines, now we have to go to great lengths to avoid Turing Completeness. It pops up in Postscript and toy programming languages and Magic: The Gathering.
(via Kottke)
