Theoretical Foundations of Computing

Course Type: 
CS
Code: 
3200
Level: 
Undergraduate
Credit Hours: 
3
Schedule Type: 
Lecture
Description: 

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.

Prerequisites: 

Undergraduate level CS 3100 Minimum Grade of C

Restrictions: 
May not be enrolled in one of the following Degrees: Intending Egr & CS. Must be enrolled in one of the following Colleges: College of Egr & Computer Sci.