CS 575 - MODELS OF COMPUTATION

Stanley and Karen Pigman College of Engineering

Credits: 3

The formal study of computation, including computability and computation with limited resources. Church’s thesis and models of computation. Formal languages and machines as recognizers of languages. The Chomsky Hierarchy of language types. Topics may include Turing machines or other basic models of computation; decidability and undecidability; basic complexity theory; finite automata and regular languages; pushdown automata and context-free languages. The course will cover primarily theory, including assignments that utilize concepts covered in lectures.

Prerequisite(s):
Prereq: CS 375 and engineering standing, or consent of instructor.