The Theory of Computation

(384-322 bc)	Chapter 0 Introduction Chapter 1 Regular Languages Chapter 2 Context-Free Languages Chapter 3 The Church-Turing Thesis	(780 approx. -850 approx.) )
(1815-1864 )	(1791-1871)	(1815-1852)
(1906-1978)	Chapter 4 Decidability TPL - The T Programming Language Diagonal Arguments, and Paradoxes Acceptance and Decidability Notes Topics in the Theory of Computing Huffmans Algorithm Some Codes Randy Dailing's presentation on Information Theory G'Ann Adamov's presentation on Public Key Encryption Phillip Lombardo's presentation on Complexity	(1912-1954)
(1897-1954)	(1903-1995)	(1909-1994)
(1928-)	Thursday September 28 - Review Tuesday October 4 - Midterm Examination The Textbook for this course is: Introduction to the Theory of Computation Michael Sipser Thompson Course Technology 2nd. Edition 2006 * Professor Wim van Dam has been kind enough to allow his PowerPoint presentations to be used in this course . I will base many of my lectures on this excellent material.	(1916-2001)