Chomsky Hierarchy - Computerphile

1,033
by Super User, 4 years ago
0 0
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: COMING SOON!
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
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. More at http://www.bradyharan.com