CS 215: Theory of Computation

2008-09 2009-10 →
changes (lax) changes (strict) ▾ 2009-10 → 2009-10 →

Units: 4

Hours: Lecture, 3 hours; outside research, 3 hours

Catalog page 193

Prerequisites: CS 150

Description: Covers phrase structure grammars and languages; turing machines; relation of languages to automata; solvable and unsolvable problems; and theoretical lim- itations of computers. Also examines algorithmic com- plexity theory; polynomial reducibility; the classes P 194 / Programs and Courses and NP; and correctness proofs. May be taken Satisfactory (S) or No Credit (NC) by students advanced to candidacy for the Ph.D.

Derived Information — The following is not part of the official catalog but is computed from catalog data.
Prerequisite graph not available.

Referenced in

Enrollment History (from UCR Banner, not catalog)
Year F W S Su Total
2025-26 19/50 19/50
2024-25 23/60 23/60
2023-24 24/60 24/60
2022-23 23/50 23/50
2021-22 34/55 34/55
2020-21 13/40 13/40
2019-20 16/40 16/40
2018-19 20/40 20/40
2017-18 16/30 16/30
2016-17 10/10 10/10