General Information Faculty Courses Research Publications

Courses Computer Science 43 Theory of Computation Instructor - Mr. Parks A study of programming in the abstract, leading to an understanding of the precise nature and limitations of computing machines. Topics include decidable and undecidable predicates, regular and push-down automata, regular and context-free grammars, and Turing machines. Also listed as Mathematics 43. Prerequisites: Mathematics 28 and Computer Science 20. Back to Courses Page Back to Lawrence University's Main Page

This page is being developed by Laura Norton. Please email comments and suggestions to nortonl@lawrence.edu.

© 2000 Lawrence University, Appleton, WI

Last Updated: March 2000