Maths›03. Logic and Foundations11.4 Halting ProblemThe undecidable problem of determining whether a Turing machine halts on a given input.
Maths›03. Logic and Foundations11.1 Machine DefinitionsFormal definition of Turing machines, including states, tape, alphabets, and transition functions.