Models of Computation
computer science
about this course
It is imperative for any graduate of computer science to understand the formal definition of computation, and the possibilities and limits of computing. Moreover, any distinction between decidability and undecidability needs a good mathematical model of computers and computation. This course introduces the powerful idea of mathematical models to analyse computation, and the nature of the relationship between formal languages, logic and machines. This course introduces the classical mathematical models used to analyse computation, including finite state automata, grammars, and Turing Machines.
in these programmes
- computer science
required · 4-year major, 4-year double major, 3-year major
one of a choice · concentration (4-year), concentration (3-year)
elective · 3-year double major, 4-year minor, 3-year minor
planning & teaching
before this
recently taught by
- Inzemamul HaqueSenior Lecturer, Computer Science
Recorded in 2025 T3, 2024 T3. Instructors may change.