CS 311 - Theory of Computation

A comparison of abstract machines and their physical counterparts, finite state machines, neural networks, regular expressions, Turing machines, the concept of computability and the relationship to machines, digital computers and universal machines. Mathematical proofs are an integral part of the course. Recommended for students considering graduate school.

Four credits.

Prerequisite(s): CS 213 or permission of the instructor.