Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home → Academic → Courses → Course Profile

COMP- 330: THEORY OF COMPUTATION

Course Summary

We study models of computation of increasing power. We begin with finite automata and regular languages. The next phase deals with context-free languages invented by linguistics and now an essential aspect of every modern programming language. Finally we explore the limits of computability with the study of recursive sets, enumerable sets, self-reproducing programs and undecidability theory.


McGill Course Description (Click Here)


Fall 2012
McGill Course Calendar Details
Course Homepage

Instructor:

  • Claude Crépeau
        Phone: 398-4716
        E-mail: crepeau AT cs DOT mcgill DOT ca
        Office Hours: Thursday 12:30-15:30

TA:

James Hirst
Simon-Keita Brisson
Hang Ma