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 (28 Jan): Intro, Models of Computation (.ps)
• Lecture 2 (2 Feb): DFA's and Kleene's Theorem (.ps)
• Lecture 3 (4 Feb): Myhill-Nerode Theorem (.ps)
• Lecture 4 (9 Feb): Context-Free Languages (.ps)
• Lecture 5 (11 Feb): Boolean Logic and Fitch Proofs (.ps)
• Lecture 6 (18 Feb): Boolean Soundness and Completeness (.ps)
• Lecture 7 (23 Feb): Turing Machines (.ps)
• Lecture 8 (25 Feb): More Turing Machines (.ps)
• Lecture 9 (1 Mar): Halting and Diagonalization (.ps)
• Lecture 10 (3 Mar): Reductions and Complete Sets (.ps)
• Lecture 11 (8 Mar): Primitive and General Recursion (.ps)
• Lecture 12 (10 Mar): An Undecidable Problem About CFL's (.ps)
• Lecture 13 (22 Mar): First-Order Logic and Fitch (.ps)
• Lecture 14 (24 Mar): Soundness of Fitch for FOL (.ps)
• Lecture 15 (31 Mar): Completeness of Fitch for FOL (as written by Dave) (.ps)
• Lecture 15 (31 Mar): Completeness of Fitch for FOL (as delivered by Neil)
• Lecture 16 (5 Apr): Number Theory and Incompleteness (.ps)
• Lecture 17 (7 Apr): Complexity, Reachability, and Hierarchy Theorems (.ps)
• Lecture 18 (12 Apr): Savitch and Immerman-Szelepcsenyi Theorems (.ps)
• Lecture 19 (14 Apr): Fagin and Cook-Levin Theorems (.ps)
• Lecture 20 (21 Apr): NP-Complete Problems (.ps)
• Lecture 21 (22 Apr): Approximations to NP-Complete Problems (.ps)
• Lecture 22 (26 Apr): Alternation (.ps)
• Lecture 23 (28 Apr): Parallelism and Boolean Circuits (.ps)
• Lecture 24 (3 May): More Boolean Circuits (.ps)
• Lecture 25 (5 May): PSPACE and Other Things (.ps)
• Lecture 26 (10 May): Randomized Computation (.ps)
• Lecture 27 (12 May): Review and Summary (.ps)

Last modified 25 April 2004