Theory of Computation | back |
|
| Course Number: | CS 334 |
| Course Name: | Theory of Computation |
| Course Coordinator | Bloom |
| Catalog Description: | Introduction to recursive functional programming and equational reasoning; lists as inductive types and list induction; introduction to formal languages, automata, and the theory of computation; regular expressions, finite state machines, and pumping lemma; context free grammars and push down automata; turing machines, recursive enumerability, and unsolvable problems; and complexity and intractability. A number of models of computation are considered, as well as their relation to various problem classes (e.g. solvable problems and polynomial time solvable problems). Some experiments are performed that involve writing small Scheme programs. |
Home |
Search |
© 2007 Stevens Institute of Technology
