COMP 5200 - Theoretical Computer Science

Institution:

Auburn University

Subject:

Description:

LEC. 3. Pr., COMP 4200 or departmental approval. The nature of the recursive sets and recursively enumerable sets. Decidability. Context-sensitive grammars and linear-bounded automata, including closure properties; oracles; reduction; the arithmetic hierarchy; the analytic hierarchy.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.auburn.edu

Phone Number:

(334) 844-4000

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.