CS 525 Theory of Computation 3.0 Credits
Theory of computation introduces basic mathematical models of computation and the finite representation of infinite objects. These topics covered in the course include: finite automata and regular languages, context free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, and time complexity.
Repeat Status: Not repeatable for credit
Prerequisites: CS 502 [Min Grade: C]