CPSC 4200 - Automata, Complexity, and Computability

Institution:

The University of Tennessee at Chattanooga

Subject:

Computer Science

Description:

An introduction to the classical and contemporary theory of computation including automata, formal languages, Turing machines, recursive functions, computability and in computability, complexity, and the classes of P and NP. Prerequisites: CPSC 1110 and MATH 3030 with minimum grades of C or department head approval. Supplementary course fee assessed.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.utc.edu

Phone Number:

(423) 425-4111

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.