CMPT 443

Computability Theory

Manhattan University · UGRD · Fall 2026

1 section

Catalog description

Turing-computable functions, and their relationship to recursive functions. Formal languages, regularity, finite and push-down automata and their simulation. Universality of programs and Turing machines. Unsolvability and an introduction to the theory of computational complexity. Fall. Prerequisite: A grade of C or better in CMPT 335 or MATH 243 .

Sections

Current meeting, instructor, credit, and enrollment details

Updated 15 hours ago

001

Availability not recently verified

Class #manhattan-CMPT443Fall 2026UGRD3 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?