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.

Review Summary

Clarity
N/A
Organization
N/A
Time
N/A
Overall
N/A

Course

Instructor
Alexander Sherstov
Previously taught
23W 22W 20F 19W 18W 17S 16W 14W 13W 12S

Previous Grades

Grade distributions not available.

Textbooks

Textbook information not available.