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.

  • Credits: Variable
  • Frequency: Every term


Requirements and Grading