University of Calgary
CPSC 313 - Introduction to Computability - Fall 2020
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 2021.
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 TBA WEB BASED Joel Reardon Outline TUT 1 TBA WEB BASED Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ST 135TUT 2 TBA WEB BASED Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ST 135TUT 3 TBA WEB BASED Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ST 135TUT 4 TBA WEB BASED Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ST 135TUT 5 TBA WEB BASED Notes: Common Quiz for all tutorial sections will be held on Thursdays at 18:00 to 18:50 in ST 135
Powered by UNITIS. More features.