University of Calgary
CPSC 313 - Introduction to Computability - Fall 2018
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 2019.
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 ENE 243 Renate Scheidler TUT 1 R 18:00 - 18:50
M 12:00 - 12:50SB 103
ST 057Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in SB 103TUT 2 R 18:00 - 18:50
M 17:00 - 17:50TBA
SA 107Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in SB 103TUT 3 W 12:00 - 12:50
R 18:00 - 18:50ST 057
TBANotes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in SB 103TUT 4 W 17:00 - 17:50
R 18:00 - 18:50ST 063
TBANotes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in SB 103
Powered by UNITIS. More features.