CSC 484
Download as PDF
CSC 484 - Theory of Computation (4 cr)
Course Title
Theory of Computation
Catalog Description
The notion of an algorithm. Primitive recursive and partial recursive functions. Turing machines and other models of computation. Markov algorithms. Church thesis. Godel numberings and unsolvability results. Halting problem. Post correspondence problem. Recursive and recursively enumerable sets. Concepts from formal language theory.
Minimum
4
Max
4
Academic Progress Units
4
Requirement Designation
Regular Non-Liberal Arts
Prerequisites & Corequisites
023467
Name
Lecture