Maths›03. Logic and Foundations12.3 Recursively Enumerable SetsSets that can be enumerated by algorithms and their role in semi-decidability and computability theory.
Maths›03. Logic and Foundations11.4 Halting ProblemThe undecidable problem of determining whether a Turing machine halts on a given input.