CSC 324Theory of Computation
Davidson College · 1 credit

Catalog
Instructor Staff Mathematical models of computation, and the fundamental capabilities and limitations of computers. Topics include regular languages, finite automata, context-free languages, grammars, Turing machines, the Chomsky hierarchy, the halting problem, algorithms, decidable and undecidable problems, algorithmic reductions, complexity theory, the classes P, NP, and PSPACE, and NP-complete problems. Satisfies an elective requirement in the Computer Science major and minor. Counts towards the Mathematics major and minor. Prerequisites One of MAT/CSC 220 or 230.
Recent sections
Spring 2027 · 1 section
Jan 19 – May 5
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| AClass #20141 | Mo We · 2:30 – 3:45 PM | Watson Life Sciences Building 147 | Raghu Ramanujan |