Theory of Computer Science

This is a course in the theory of computation, a field that is considerably older than computers and computer science itself. We will look at issues related to

whatcan be algorithmically computed and what can be said about the compuational process, including time and space complexity. Although the models of computation we will use are quite concrete and easily programmed, our interest in them is primarily mathematical. We will write many proofs, just as you did in theAlgorithmsclass.

**Textbook**: Automata and Computability by Dexter Kozen (Springer Verlag 1997)

- Topics for Exam 1
- Exam 1 from 2007
- Solutions to Exam 1 from 2007
- Ssolutions to this semester's Exam 1

- Topics for Exam 2
- Exam 2 from 2007
- Solutions to Exam 2 from 2007
- Solutions for this semester's Exam 2

- HW 1, due Wednesday February 8
- HW 2, due Wednesday February 15
- HW 3, due Wednesday, February 22
- HW 4, due Wednesday, March 1
- HW 5, due Friday, March 17
- HW 6, due Wednesday, April 5
- HW 7, due Wednesday, April 12
- HW 8, due Wednesday, May 3