An Introduction to the Theory of Computation
Course #: CS 420, Class #: 1249, Section #: 01
Description
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.
Prerequisites
CS 220 (grade of C- or better)
Course Details
Date / Time
1/26/26 - 5/13/26
MoWe 4p.m. – 5:15p.m.
Location
University Hall Y02-2330
Credits
3
Session
Regular Academic Session
Class Dates
1/26/2026 - 5/13/2026
Location
University Hall Y02-2330
Enrolled / Capacity
65 / 65
Status
Closed