CSCI 383
Theory of Computation

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 what can 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 the Algorithms class.

Textbook: Automata Theory, Languagges, amd Computation by Hopcroft, Motowani, and Ullman

Note: My office hours during Reading Period will be somewhat restricted. I will be available

Wednesday 12/12 1:30-4:30
Thursday 12/13 9:30-1:30
Friday 12/14 9:30-10:30

All day Monday 12/17 and Tuesday 12/18

 

Syllabus

Resources

Exam 1

Exam 2 -- Monday November 19

Final Exam -- Wednesday December 19, 2PM

Class Notes

Homework