computer science

OPENS DOORS

COSC341

Theory of Computing

Semester 1

This course, which assumes some mathematical background, will explore the hierarchy of languages that are accepted by the fundamental machines of computer science, including finite automata and Turing machines. Discussion of the limits to computation will lead to a review of classic problems such as the halting problem, and consideration of recursive functions and predicates. The course concludes with a discussion of cost in space and time and the classification of languages and problems according to their complexity.

COURSEWORK PAGE