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: 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
Видео Busy Beaver Turing Machines - Computerphile канала Computerphile
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
Видео Busy Beaver Turing Machines - Computerphile канала Computerphile
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
The Most Difficult Program to Compute? - ComputerphileUndecidability Tangent (History of Undecidability Part 1) - ComputerphileTuring Machine Primer - ComputerphileEDSAC Simulator - ComputerphileTuring Machines - The Accidental Birth of Computer ScienceThe Enormous TREE(3) - NumberphileThe Daddy of Big Numbers (Rayo's Number) - NumberphileAll the Numbers - NumberphileArrays vs Linked Lists - ComputerphileTuring machines explained visuallyReflections on Trusting Trust - ComputerphileTuring Complete - ComputerphileMaze Solving - ComputerphileBinary Coded Decimal (BCD) & Douglas Adams' 42 - ComputerphileExploiting the Tiltman Break - ComputerphileGödel's Incompleteness Theorem - NumberphileWhen Unix Landed - ComputerphileBarber & Russell Paradoxes (History of Undecidability Part 2) - ComputerphileTREE vs Graham's Number - Numberphile