Chapter 7: Undecidability and Intractability — Theory of Computation (CSC262) Notes
Computational Complexity, Time and Space Complexity, Complexity Classes, Reducibility, Cook's Theorem, Undecidability, Post's Correspondence Problem, Halting Problem.
Notes Arriving Soon
Handwritten chapter notes for this subject are currently being digitized. Help your fellow students by contributing your notes!
Topics & Key Objectives in Chapter 7
Computational ComplexityTime and Space ComplexityComplexity ClassesReducibilityCook's TheoremUndecidabilityPost's Correspondence ProblemHalting Problem.