Theory of Computation
CS 7805 Spring 2015

College of Computer and Information Science
Northeastern University

The course examines formal models of computation, notions of undecidability, and basic complexity theory. Models of computation include finite state automata, pushdown automata, and Turing machines. Discusses the properties of regular sets and context-free languages. Also covers partial recursive functions, primitive recursive functions, recursively enumerable sets, Turing decidability, and unsolvable problems. Discusses the concept of reductions, time and space complexity classes, and the polynomial-time hierarchy.

The course is open only to computer science PhD students. CS 7800 is a prerequisite.