Academics

Course Catalog

GRAD > CS > 620

Theory of Computation

Description:
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:

2013 Fall

Section Class Number Weekly Schedule Time Instructor Location
01 9277 MW 04:00 PM - 05:15 PM Simovici,Dan M01-0208 More Info