Description
This course covers some fundamental concepts in computing and mathematical models. Finite state machines, pushdown automata, and Turing Machines are covered. These are theoretical classes of machines listed in increasing computational power. The course will also cover regular expressions, context-free languages, and argue that Turing machines are the equivalent of modern computers. (The latter is known as the Turing Thesis or as the Church-Turing thesis.) Offered: Fall.