Search Results

CSEĀ 602. Computation and Complexity Theory. 4 Units.

Prerequisites: CSE 500 or consent of instructor
Theoretical foundations of computer science: deterministic and non-deterministic Turing machines, models of computation; recursive functions, Church's thesis and undecidable problems; complexity classes P, NP, CO-NP and PSPACE. May not be taken for credit by students who have received credit for CSE 501, CSE 546, CSE 646. Formerly CSE 600.