MATH 3270 - Theory of Computability

Institution:

University of Connecticut-Tri-Campus

Subject:

Description:

(237) Either semester, alternate years. Three credits. Prerequisite: MATH 2710 or 2142 or CSE 2500. Finite automata and regular languages, pushdown automata and context-free languages and grammars. Turing machines, recursively enumerable sets and grammars, Church's thesis, the halting problem, and other undecidable problems. Computational complexity and NP-completeness.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.uconn.edu

Phone Number:

(860) 486-2000

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.