COM SCI 281A

Computability and Complexity

Description: 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.

Units: 4.0
1 of 1
1 of 1