2017-18 Catalog

Search Results

CSE 318 Introduction to the Theory of Computation 3 Credits

Provides a deep understanding of computation, its capabilities and its limitations. The course uses discrete formal methods to (1) formulate precise definitions of three kinds of finite-state machines (finite automata, pushdown automata, and Turing machines); (2) prove properties of these machines by studying their expressiveness (i.e., the kinds of problems that can be solved with these machines), and (3) study computational problems that cannot be solved with algorithms.
Prerequisites: CSE 261 or MATH 261