DESCRIPTION
Finite state automata, pushdown automata, Turing Machines, and the languages they can recognize. Church’s Thesis. Computibility. The classes P and NP; NP-complete and intractable problems.
Prereq: CSc 10400. 3 hr./wk.; 3 cr.
Last Updated: 07/30/2015 07:54