CMPSC230 Header

Class Schedule

Posted on August 25, 2014

Course Summary: In this course, we will discuss a number of models for computation, as well as the theoretical limits of computation. We will understand the differences between finite-state machines, pushdown automata, and Turing machines, as well as the languages that each of these models are capable of recognizing. We will explore a number of solvable and unsolvable problems in computational theory, and understand how these problems relate to each other. We will also discuss the ideas of computational complexity, P-space, and NP-completeness. There are no lab sessions associated with this course.

Instructor Info:
Professor: John Wenskovitch
Office: 104 Alden Hall
Email: jwenskovitch(at)allegheny(dot)edu
Class Meetings: TTH 9:30-10:45
Office Hours: Book an Appointment!

Course Info:
Required Text: Introduction to the Theory of Computation, Michael Sipser, 2nd or 3rd edition (ISBN13: 978-1133187790).