University of Calgary
CPSC 313 - Introduction to Computability - Fall 2019
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.SyllabusThis course will be offered next in Winter 2020.
This course may not be repeated for credit.
Hours
- H(3-2T)
Notes
- One of Computer Science 319 or 331 is strongly recommended as preparation for this course.
Prerequisite(s)
- One of Mathematics 271 or 273, one of Philosophy 279 or 377, and one of Computer Science 219, 233 or 235.
Sections
LEC 1 MWF 11:00 - 11:50 CHC 105 Joel Reardon TUT 1 M 12:00 - 12:50
R 18:00 - 18:50ST 057
ICT 102Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ICT 102TUT 2 R 18:00 - 18:50
M 17:00 - 17:50TBA
ST 057Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ICT 102TUT 3 R 18:00 - 18:50
W 12:00 - 12:50TBA
ST 057Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ICT 102TUT 4 R 18:00 - 18:50
W 17:00 - 17:50TBA
ST 057Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ICT 102TUT 5 R 18:00 - 18:50
F 12:00 - 12:50TBA
ST 063Cooper Davies Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ICT 102
Powered by UNITIS. More features.