|
|
Feb 02, 2025
|
|
2012-2015 Academic Catalog [ARCHIVED CATALOG]
|
CS 3200 - Theoretical Foundations of Computing Course Type: Computer Science Credit Hour(s): 3 Introduction to the theory of formal languages and automata with an emphasis on the classes of languages commonly encountered by computer scientists. Computability examines the solution of decision problems; the Church-Turing thesis; the undecidability of the Halting Problem; and problem reduction and undecidability. Prerequisite(s): Undergraduate level CS 3100 Minimum Grade of C STEM 3 Level: Undergraduate Schedule Type(s): Lecture
|
|
|