Theory of Computation
description
The application of logic and proof techniques to Computer Science. Mathematical induction; correctness proofs for iterative and recursive algorithms; recurrence equations and their solutions; introduction to automata and formal languages.
This course assumes university-level experience with proof techniques and algorithmic complexity.