Busy Beaver Turing Machines - Computerphile
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: • Turing Machine Primer - Computerphile
Busy Beaver Code: • Busy Beaver Code - Computerphile
Ackermann Follow Up: • Ackermann Follow Up - Computerphile
Original 'Ackermann' Film (Most Difficult Program to Compute): • The Most Difficult Program to Compute...
/ computerphile
/ 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
Watch video Busy Beaver Turing Machines - Computerphile online without registration, duration hours minute second in high quality. This video was added by user Computerphile 02 September 2014, don't forget to share it with your friends and acquaintances, it has been viewed on our site 417,41 once and liked it 7.9 thousand people.