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 2013

McGill Course Calendar Details
Course Homepage

Instructor:

  • Prakash Panangaden
        Phone: 398-7074
        E-mail: prakash AT cs DOT mcgill DOT ca
        Office Hours: TBA

TA:

Artem Kaznatcheev
Heng Ma