DEPRECATED Spring 2022 Theory of Computation ×  OverviewClassify languagesDecision problemsAutomataOther Models of ComputationComputability techniquesCalibrate difficulty

Computability techniques

Learning Goal

Apply classical techniques including pumping lemma, determinization, diagonalization, and reduction to analyze the complexity of languages and problems.

Subtopics