CMPSCI 601: Theory of Computation

David Mix Barrington

Spring, 2003

This page contains links to lecture notes for CMPSCI 601, Spring 2003. The notes are in PDF format and may be read with Adobe Acrobat Reader or other software. It is helpful when possible to read the note before the lecture.

There are also Postscript versions of these lectures available, just change the ".pdf" in the file name to ".ps".

Videotapes of the lectures are available in the CMPSCI main office for short-term loan. As we have only one copy of each tape, please use this privilege sparingly.

• Lecture 1 (29 Jan): Intro, Kleene's Theorem
• Lecture 2 (3 Feb): Myhill-Nerode Theorem
• Lecture 3 (5 Feb): Context-Free Languages
• Lecture 4 (10 Feb): Turing Machines
• Lecture 5 (12 Feb): More Turing Machines
• Lecture 6 (19 Feb): Halting and Diagonalization
• Lecture 7 (24 Feb): Reductions and Complete Sets
• Lecture 8 (26 Feb): Primitive Recursion, Upper Bounds
• Lecture 9 (28 Feb): An Undecidable Problem About CFL's
• Lecture 10 (3 Mar): Propositional Logic and Circuits
• Lecture 11 (5 Mar): First-Order Logic and Truth
• Lecture 12 (10 Mar): Tarski Game, First-Order Axioms
• Lecture 13 (12 Mar): Axioms, Metatheorems
• Lecture 14 (24 Mar): Completeness and Compactness
• Lecture 15 (26 Mar): Godel's Incompleteness Theorem
• Lecture 16 (2 Apr): Complexity: Reachability
• Lecture 17 (7 Apr): Nondeterministic Space
• Lecture 18 (9 Apr): The Fagin and Cook-Levin Theorems
• Lecture 19 (14 Apr): NP-Complete Problems
• Lecture 20 (16 Apr): Approximations of NP-Complete Problems
• Lecture 21 (23 Apr): Alternation
• Lecture 22 (30 Apr): Parallelism and Circuits
• Lecture 23 (2 May): More Circuits
• Lecture 24 (5 May): PSPACE and Other Things
• Lecture 25 (7 May): Randomized Computation
• Lecture 26 (12 May): Crypto and Interaction
• Lecture 27 (14 May): Review and Conclusions

Last modified 10 May 2003