Jump to Menu

• Undergraduate Fall 2016
• Computer Science
• THEORY OF COMPUTATION

THEORY OF COMPUTATION

2016 Fall Term

Computer Science 434

This course is an introduction to the theory of computation. It discusses finite automata and Turing machines as models of computation. It includes discussions of regular sets, recursive and partially recursive functions, context free grammars, the halting problem, undecidable problems, complexity, and Np-completeness.

Other Requirements: PREREQ: MATH 280 OR COMPSCI 215

Class Schedule

There are no sections offered for this course and term that meet your criteria.