University of Pittsburgh


Course Title: 
Theory of Computation
Credits vary

This course deals with computability theory, automata theory and formal languages. Various models of computation will be examined, their relations to each other and their properties will be studied. Topics include models for computable functions and Church's thesis, models for recognizers and their relation to formal grammars, algorithmically solvable and insolvable problems, and the complexity of computations.

CS 1511 or its equivalent.
Spring 2015, Summer 2015, Fall 2015, Spring 2016, Fall 2019

Copyright 2009–2021 | Send feedback about this site