Course Catalog

UGRD > CS > 420

An Introduction to the Theory of Computation

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.

Offered in:

2017 Fall

Section Class Number Schedule/Time Instructor Location
01 3780 TuTh
12:30 - 13:45
Fejer,Peter A W01-0004
Session: Regular
Class Dates: 09/05/2017
Capacity: 70
Enrolled: 53
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-req = CS 320L
Course Attributes:

2017 Spring

Section Class Number Schedule/Time Instructor Location
01 1409 MW
19:00 - 20:15
Fejer,Peter A Y02-2300
Session: Regular
Class Dates: 01/23/2017
Capacity: 70
Enrolled: 73
Status: Closed
Credits: 3/3
Class Notes:
Pre Requisites: Pre-req = CS 320L
Course Attributes:
01C 14207 MW
19:00 - 20:15
Fejer,Peter A Y02-2300
Session: CE Ses 2
Class Dates: 01/23/2017
Capacity: 5
Enrolled: 1
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-req = CS 320L
Course Attributes: