CS 6723 - Computability Theory

Sem. Hrs: 3

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

Prerequisites: CS 5723 or “B” or better in CS 5032 and permission of professor.