2026 Spring > UGRD > CS > CS 420
An Introduction to the Theory of Computation
Course #: CS 420
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.
Pre Requisites:
Pre-requisite: CS 220 (grade of C- or better)
| Section | Class Number | Schedule/Time | Instructor | Location | |
|---|---|---|---|---|---|
| 01 | 1249 | MW 4:00 - 5:15 pm |
Sepahyar,Soheil | University Hall Y02-2330 | |
|
Session:
Regular
Class Dates:
01/26/2026 - 05/13/2026
Capacity:
65
Enrolled:
65
Status:
Closed
Credits:
3/3
Class Notes:
Pre Requisites:
Pre-requisite: CS 220 (grade of C- or better)
Course Attributes:
|
|||||
| 03 | 3900 | TuTh 4:00 - 5:15 pm |
Sepahyar,Soheil | McCormack M02-0116 | |
|
Session:
Regular
Class Dates:
01/26/2026 - 05/13/2026
Capacity:
50
Enrolled:
50
Status:
Closed
Credits:
3/3
Class Notes:
Pre Requisites:
Pre-requisite: CS 220 (grade of C- or better)
Course Attributes:
|
|||||