Department of Computer Science

Course director: A. Mirzaian
Implementation details

COSC 4111.03 Automata and Computability

Section M  Fall      Tue, Thu 14:30-16:00

This course is the second course in the theory of computing. It is intended to introduce students to the formal method of analysis of computational phenomena intuitively described as computability, unsolvability, complexity, etc, their meanings and theoretical importance. Topics chosen for study include: models of Turing machines and the techniques for their construction; undecidability phenomena; introduction to computational complexity theory; intractable problems.

Texts: t.b.a.

Prerequisites: general prerequisites, including COSC3101.03;MATH2320.03