THEORY OF COMPUTATION
2016 Spring Term
Computer Science 434
This course is an introduction to the theory of computation. It discusses finite automata and Turing machines as models of computation. It includes discussions of regular sets, recursive and partially recursive functions, context free grammars, the halting problem, undecidable problems, complexity, and Np-completeness.
Other Requirements: PREREQ: MATH 280 OR COMPSCI 215
- This schedule is informational and does not guarantee availability for registration.
- Sections may be full or not open for registration. Please use WINS if you wish to register for a course.
|Section Details||Meeting Details & Topic||Instructor||Syllabus|
|01/19 - 05/17 (1)||TuTh 11:00 AM - 12:15 PM||