University of Calgary
CPSC 313 - Introduction to Computability - Fall 2012
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 2013.
This course may not be repeated for credit.
Hours
- H(3-2T)
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 ST 139 Peter Hoyer Notes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held in common roomTUT 1 T 10:00 - 10:50
R 18:00 - 18:50ST 061
TBANotes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held in common room ST 135TUT 2 M 17:00 - 17:50
R 18:00 - 18:50ST 057
TBANotes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held common room ST 135TUT 3 W 12:00 - 12:50
R 18:00 - 18:50ST 061
TBANotes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held in common room ST 135
Powered by UNITIS. More features.