CMPT 443 - Computability Theory

Institution:

Manhattan College

Subject:

Description:

Turing-computable functions, and their relationship to recursive functions. Formal languages, regularity, finite and pushdown automata and their simulation. Universality of programs and Turing machines. Unsolvability and an introduction to the theory of computational complexity. Fall. Prerequisite: CMPT 335 or MATH 213. (Cr. 3) 454. Compiler Design. Introduction to automata and context-free grammars. Basic techniques of parsing and derivations. Generators, symbol tables, syntax-directed translation. Error detection, optimization, and data-flow analysis. Spring. Prerequisite: Permission of the instructor. (Cr. 3)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.manhattan.edu

Phone Number:

(718) 862-8000

Regional Accreditation:

Middle States 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.