Maths›03. Logic and Foundations12.1 ReducibilityFormal methods for comparing decision problems using many-one and Turing reducibility.
Maths›03. Logic and FoundationsChapter 12. Degrees of UnsolvabilityReducibility, Turing degrees, recursively enumerable sets, Post's problem, and the structure of degrees.