Turing Machine Primer – Computerphile

This Primer is to accompany the ‘Busy Beaver Turing Machines’ film which can be viewed here:

Professor Brailsford’s code and further reading:

Turing and the Halting Problem:
Busy Beaver Turing Machines:
Domino Addition – Numberphile:
Ackermann Follow Up:

‘Turing Machines Collection’ Playlist:

“The Most Difficult Program to Compute?” (Original Ackermann Film):

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham:

Computerphile is a sister project to Brady Haran’s Numberphile. See the full list of Brady’s video projects at:

Products You May Like

Articles You May Like

Footnote †: Unstable Equilibrium
18 Forbidden Places
Spinning Tube Trick Answer
Explore The Solar System! — DONG
A tricky toothpick puzzle

Leave a Reply

Your email address will not be published.