CS 620 - Advanced Theory of Computation

3 credits

Students in this class study 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.

Click here for the Summer 2024 Class Schedule

Click here for the Fall 2024 Class Schedule

Click here for the Spring 2025 Class Schedule

Click here for the Summer 2025 Class Schedule