Unlocking the Mystery of Busy Beaver Turing Machines 🤖

The Busy Beaver game, pointless? Or a lesson in the problems of computability? - How do you decide if something can be computed or not?

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

Turing Machine Primer: http://youtu.be/DILF8usqp7M
Busy Beaver Code: http://youtu.be/ZiTeuZSDB0U
Ackermann Follow Up: http://youtu.be/uNACwX-O5lk
Original 'Ackermann' Film (Most Difficult Program to Compute): http://youtu.be/i7sm9dzFtEI

http://www.facebook.com/computerphile
https://twitter.com/computer_phile

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