CSC236H1: Introduction to the Theory of Computation

Hours

24L/12T

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.

Prerequisite
(60% or higher in CSC148H1, 60% or higher in CSC165H1) / (60% or higher in CSC111H1)
Exclusion
Distribution Requirements
Science
Breadth Requirements
The Physical and Mathematical Universes (5)