University of Calgary

CPSC 313 - Introduction to Computability - Winter 2021

An introduction to abstract models of sequential computation, including finite automata, regular expressions, context-free grammars, and Turing machines. Formal languages, including regular, context-free, and recursive languages, methods for classifying languages according to these types, and relationships among these classes.
This course may not be repeated for credit.


  • H(3-2T)


  • Mathematics 271 or 273; and Philosophy 279 or 377; and 3 units from Computer Science 219, 233 or 235.


  • Credit for Computer Science 313 and Computer Science 351 will not be allowed.


This course will be offered next in Winter 2022.
Powered by UNITIS. More features.