Course Catalog

UGRD > CS > 420

An Introduction to the Theory of Computation

This course introduces such theoretical aspects of computing as models of computation, inherent limits on computation, and feasible computation. Topics include definition of computable functions (recursive functions, functions computable by Turing machines, functions computable in a programming language), unsolvability of the halting problem and related problems, the classes P and NP, finite automata, and context-free grammars.

Section Class Number Weekly Schedule Time Instructor Location