2018-2019 Graduate Catalog 
    
    Apr 21, 2019  
2018-2019 Graduate Catalog
[Add to Portfolio]

CS 620 - Theory of Computation II

3 credits
Turing machines, the Church-Turing thesis, decidability, the halting problem, reducibility, recursive function theory, the recursion theorem, time and space complexity, classes P and NP, NP-completeness.

Prerequisites
CS 420 with a C or better or CS 520 with a C or better


Click here for the Spring 2019 Class Schedule

Click here for the Summer 2019 Class Schedule

Click here for the Fall 2019 Class Schedule




[Add to Portfolio]