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

Why Americans don’t trust each other | Todd Rose for Big Think
The Infinite Zoetrope – Smarter Every Day 90
3 Mind-Blowing Recent Dinosaur Discoveries
Michio Kaku: String Theory Is The Only Game In Town | Big Think
Riddle For Genius – When Does The Thief Tell The Truth?

Leave a Reply

Your email address will not be published. Required fields are marked *