This is a graduate-level course studying the theoretical foundations of computer science. Topics covered will be models of computation from automata to Turing machines, computability, time and space complexity theory, Boolean circuits, and interactive proof systems.
Course Offerings
There are no sections currently offered, however you can view a sample syllabus from a prior section of this course.