Theoretical Computer Science
In-depth exploration of the foundations of, the limitations of, and the open questions related to theoretical computer science and computation. Topics include models of computation such as deterministic and nondeterministic automata, context free grammars, pushdown automata and Turing machines; decidability and the halting problem; time and space complexity; the P=NP? question; NP-complete problems; reductions; randomness and probabilistic algorithms. Advanced topics vary across semesters.
Prerequisite: ECE 365
Credits: 3.00
Course Code: ECE 461
