CS 3780 - Introduction to Computational Theory
Intended to provide a solid theoretical foundation for computer science students. A series of artificial machines such as finite state automata, push-down automata and Turing machines are be defined and studied as formal models of computers. Studies their corresponding formal languages such as regular, context-free and unrestricted languages. Discusses related issues such as Church's Thesis, Halting problem and general incompatibility. Falls. Prerequisite(s): CS 3221.
*All course information is from the 2013-2014 Catalog.