Loading...

Busy Beaver Turing Machines - Computerphile

214,399 views

Loading...

Loading...

Transcript

The interactive transcript could not be loaded.

Loading...

Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Sep 2, 2014

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

Loading...

Advertisement
When autoplay is enabled, a suggested video will automatically play next.

Up next


to add this to Watch Later

Add to

Loading playlists...