3Credit Hour(s)3Lecture Hour(s)0Lab Hour(s) Abstract basis of machines and programming; automata, context free grammars, and Turing machines; equivalence and non-equivalence of classes of devices; Chomsky hierarchy; incomputability; computational complexity.