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
Units: 4.0
1 of 1
Most Helpful Review
Winter 2016 - Sherstov is probably one of the best professors you could have here at UCLA. His has great passion for the material and explains them clearly. The grading is based on three components only: midterm, final and a scribe note, where you typeset a chosen lecture in Latex. Took it as undergrad without much math background (it's basically a math class full of proofs!), not hard as long as you don't fall behind.
Winter 2016 - Sherstov is probably one of the best professors you could have here at UCLA. His has great passion for the material and explains them clearly. The grading is based on three components only: midterm, final and a scribe note, where you typeset a chosen lecture in Latex. Took it as undergrad without much math background (it's basically a math class full of proofs!), not hard as long as you don't fall behind.
1 of 1
