You are here

COMP 350: Theory of Computation

Term: Spring

Credits: 4

Degree Requirements:

A study of theoretical models for computing. The hierarchy of finite state machines, pushdown machines, context free grammars, and
Turing machines will be analyzed, along with their variations. The basic concepts of decidability, complexity theory, and NP-Complete
problems will be introduced. (Course offered in alternate years; scheduled for 2016-2017.)

Prerequisites: Discrete Structures for Computer Science,