|
||||
CS 3200 - Theoretical Foundations of ComputingCredit 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 Enrollment Restrictions: May not be enrolled in one of the following Degrees: Intending Egr & CS, Pre_Degree. Must be enrolled in one of the following Colleges: College of Egr & Computer Sci. Level: Undergraduate Schedule Type(s): Lecture
|
||||
All catalogs © 2024 Wright State University. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|