Detailed Course Information |
2025 Winter
Apr 22, 2025 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 890AK - Computability and Complexity |
|
Finite automata. Context-free grammars and push-down automata. Turing machine. The universal Turing machine. Nondeterministic Turing machine. The halting problem and unsolvability. Post correspondence problem. Time complexity. Space complexity.
3.000 Credit hours 3.000 Lecture hours 0.000 TO 3.000 Other hours Levels: Graduate Schedule Types: Lecture, Report, Independent Study, Directed Reading, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Graduate |
| Return to Previous | New Search |
|