COMSC 335 - Theory of Computation
Prerequisites: COMSC 111 , MATH 221 or permission of instructor Students with COMSC 240 are not eligible to take this course except for grade replacement
Formal models of computation provide the framework for analyzing computing devices, with the goal of understanding the types of computations, which may be carried out on them. Finite and pushdown automata and the classes of languages, which they recognize, occupy the first part of the course. The remainder of the course addresses Turing machines, recursive functions, Church’s Thesis, undecidability, and NP-completeness.
3 credits
Fall
Add to Portfolio (opens a new window)
|
