COMP 2613 – Introduction to Computability (formerly COMP 3313)
(3 credits – TG) 3 hours lecture, 2 hours tutorial
This course provides students with an opportunity to gain insight into the theoretical foundations of computing science. Topics include abstract machines (finite automata; push down automata and Turing machines), the hierarchy of formal languages (regular, context-free, and recursive) recognized by these machines, and applications of these languages.
Prerequisites: Mathematics 1271 and Computer Science 1633 or 2005 with minimum grades of C- or higher.