University of Calgary
CPSC 313 - Introduction to Computability - Winter 2016
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 Spring 2016.
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 12:00 - 12:50 ENE 239 Peter Hoyer TUT 1 M 14:00 - 14:50
R 18:00 - 18:50SA 123
EDC 179Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in EDC 179TUT 2 W 14:00 - 14:50
R 18:00 - 18:50SA 123
TBAHaysn Hornbeck Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in EDC 179TUT 3 M 17:00 - 17:50
R 18:00 - 18:50SS 117
TBANotes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in EDC 179TUT 4 W 17:00 - 17:50
R 18:00 - 18:50SA 123
TBANotes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in EDC 179TUT 5 W 15:00 - 15:50
R 18:00 - 18:50ST 125
TBAHaysn Hornbeck Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in EDC 179
Powered by UNITIS. More features.