|Select the desired Level or Schedule Type to find available classes for the course.|
|CSC 430 - Computability And Automata|
Computability And Automata
Prerequisites: CSC 325
This course discusses more advanced topics of theoretical computer science emphasizing computability (how to tell whether a problem is algorithmically solvable) and advanced automata theory. Topics chosen from the concept of algorithms, Turing Machines, Post Machines, computational complexity theory, Church's hypothesis, Rice's theorem, Greibach's theorem, P, NP, NP-complete, and co-NP problems.
3.000 Credit hours
3.000 Lecture hours
Schedule Types: Lecture
Computer Science Department
May not be enrolled in one of the following Levels:
Prerequisite CSC 430
Course or Test: CSC 325
May not be taken concurrently.
|Return to Previous||New Search|