Busy Beaver Turing Machines - Computerphile
Автор: Computerphile
Загружено: 2014-09-02
Просмотров: 461809
Описание:
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? - C...
/ 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
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
