Course Catalog

GRAD > CS > 620

Theory of Computation

Functions computable by programs. Recursive functions and Turing machines; simulation and diagonalization. Universality and unsolvable problems. Kleene's hierarchy and the recursion theorem. Gregorczyk's hierarchy and Ackermann's function. Abstract complexity. Formal languages and classes of automata. Inherently difficult combinatorial problems.

Offered in:

2016 Spring

Section Class Number Weekly Schedule Time Instructor Location
01 14027 MW 07:00 PM - 08:15 PM Simovici,Dan W01-0053 More Info