CS 6783, Computability Theory

Course Description
Turing machines and equivalent models of computation. The universal Turing machine and unsolvability results. Study of computable functions. Problem classification and hierarchy.

Prerequisite
CS 4393/5393 (Automata Theory) or permission of professor.

Scheduling
This course is currently offered in the fall semester of odd-numbered years.

Offerings
Fall 2007, Section 001Huang, X. MWF 01:00-01:50CSM 212