Turing Machine Primer – Computerphile

This Primer is to accompany the ‘Busy Beaver Turing Machines’ film which can be viewed here: http://youtu.be/CE8UhcyJS0I

Professor Brailsford’s code and further reading: http://bit.ly/busybeaver

Turing and the Halting Problem: http://youtu.be/macM_MtS_w4
Busy Beaver Turing Machines: http://youtu.be/CE8UhcyJS0I
Domino Addition – Numberphile: http://youtu.be/lNuPy-r1GuQ
Ackermann Follow Up: http://youtu.be/uNACwX-O5lk

‘Turing Machines Collection’ Playlist: http://www.youtube.com/playlist?list=PLzH6n4zXuckrEzV0CB1xXbSdsP_a7VUoK

“The Most Difficult Program to Compute?” (Original Ackermann Film): http://youtu.be/i7sm9dzFtEI


This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: http://bit.ly/nottscomputer

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

Products You May Like

Articles You May Like

New Results in Quantum Tunneling vs. The Speed of Light
abc Conjecture – Numberphile
What Is The Area? Challenge From Croatia
How to control someone else’s arm with your brain | Greg Gage
The communication error we all make, and how it intensifies conflict | Esther Perel | Big Think

Leave a Reply

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