CSC 544 - Theory of Computation

Institution:

University of Rhode Island

Subject:

Description:

Finite automata, pushdown automata, formal grammars and Chomsky hierarchy, Turing machines, computability, basics of complexity theory. Advanced topics including some of the following: cryptography, interactive proofs, circuit complexity, completeness for various complexity classes, relations among complexity classes, new models of computation. (Lec. 3, Project 3) Pre: 440 or 445. In alternate years.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.uri.edu/

Phone Number:

(401) 874-1000

Regional Accreditation:

New England Association of Schools and Colleges

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.