Feb 19, 2026  
2025-2026 University Catalog 
    
2025-2026 University Catalog
Add to Portfolio (opens a new window)

CS 48300 - Introduction To The Theory Of Computation


Credit Hours: 3.00.  Turing machines and the Church-Turing thesis; decidability; halting problem; reducibility; undecidable problems; decidability of logical theories; Kolmogorov complexity; time classes; P, NP, NP-complete; space classes; Savitch’s theorem, PSPACE-completeness, NL-completeness; hierarchy theorems; approximation theorems; probabilistic algorithms; applications of complexity to parallel computation and cryptography.
Credits: 3.00



Add to Portfolio (opens a new window)