Computer

Chomsky Hierarchy – Computerphile

Uncomputable through to finite state – Professor Brailsford explains Chomsky’s hierarchy.

Turing and the Halting Problem: https://youtu.be/macM_MtS_w4
“Most Difficult Program” – Ackermann Function: http://youtu.be/i7sm9dzFtEI
Busy Beaver Turing Machines: https://youtu.be/CE8UhcyJS0I
Finite State Automata: https://youtu.be/vhiiia1_hC4
Reverse Polish & The Stack: https://youtu.be/7ha78yWRDlE
Programming in Postscript: https://youtu.be/S_NXz7I5dQc

Professor Brailsford’s Notes: http://bit.ly/computerphile_Chomsky
Professor Brailsford’s t-shirt kindly supplied by Peleg Bar Sapir

http://www.facebook.com/computerphile

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. More at http://www.bradyharan.com

Products You May Like

Articles You May Like

Amazing Animal Defenses — FAK #23
How did quietness become a sign of quality? [Advertiser content from 3M]
Why artists get a natural shot of dopamine on stage | Christiani Wetter, Karin Ospelt | TEDxVaduz
AsapSCIENCE Needs Your Help!
A glimpse of life on the road | Kitra Cahana

Leave a Reply

Your email address will not be published.