Introduction to the Theory of Computation
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 as provided by CSC165H1 . Very strong students who already have this experience (e.g. successful completion of MAT157Y1 ) may consult the undergraduate office about proceeding directly into CSC236H1 or CSC240H1 .
Prerequisites & course information
Prerequisite: (60% or higher in CSC148H1 / 60% or higher in CSC148H5 / 60% or higher in CSCA48H3 ; 60% or higher in CSC165H1 / 60% or higher in MAT102H5 / 60% or higher in CSCA67H3 / 60% or higher in MATA67H3 )/ 60% or higher in CSC111H1 .; Prerequisite:; Exclusion: CSC240H1 , CSC236H5 , CSCB36H3; Exclusion:
Sources
- Course catalogue ↗2026-2027