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.This course will be offered next in Winter 2022.
This course may not be repeated for credit.
Hours
- H(3-2T)
Prerequisite(s)
- Mathematics 271 or 273; and Philosophy 279 or 377; and 3 units from Computer Science 219, 233 or 235.
Antirequisite(s)
- Credit for Computer Science 313 and Computer Science 351 will not be allowed.
Sections
LEC 1 MWF 12:00 - 12:50 Wayne Michael Eberly Outline TUT 1 M 14:00 - 14:50
R 18:00 - 18:50Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in ST 135TUT 2 W 14:00 - 14:50
R 18:00 - 18:50Notes: All tutorial sections will have a common quiz on Thursdays at 1800 to 1850 in ST 135TUT 3 M 17:00 - 17:50
R 18:00 - 18:50Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 1850 in ST 135TUT 4 W 17:00 - 17:50
R 18:00 - 18:50Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in ST 135TUT 5 W 15:00 - 15:50
R 18:00 - 18:50Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in ST 135
Powered by UNITIS. More features.