dibs

COM SCI 281A: Computability and Complexity

Lecture, four hours; outside study, eight hours. Requisite: course 181 or compatible background. Concepts fundamental to study of discrete information systems and theory of computing, with emphasis on regular sets of strings, Turing-recognizable (recursively enumerable) sets, closure properties, machine characterizations, nondeterminisms, decidability, unsolvable problems, easy and hard problems, PTIME/NPTIME. Letter grading.

4 units, graduate

Offered Winter quarters

Predicted GPA
3.73
A or A minus
96%
D, F or withdrew
0%
Lec 1
Tue/Thu 2:00-3:50 PM
Boelter Hall 5280
Sherstov, A.
By instructor
Winter 2023 to Winter 2024
All instructors
3.73 GPA
96% A
0% DFW
24 grades
SHERSTOV
3.84 GPA
96% A
0% DFW
24 grades
Prerequisites
Requisite: course 181 or compatible background.
Restrictions
Graduate Computer Science Majors and Graduate Students
Grading
Letter only
Final exam
Mon Mar 15, 11:30 AM

What past students say about SHERSTOV in this class

No student reviews of SHERSTOV in this class were read.