KnowraHalting problemLinked fromLinked fromThe 32 pages that link to Halting problem, each with the reason it gives.All 32Broader topic 12Related 18Compared with 2Gödel's incompleteness theoremsRelated: The computational translation of incompleteness into a concrete algorithmic impossibility.Church–Turing thesisRelated: The thesis concerns what algorithms can compute, including limits proved within the model.Gödel numberingRelated: Numerical codes for programs make it possible to formulate and prove undecidability results arithmetically.EntscheidungsproblemRelated: A hypothetical solution to the Entscheidungsproblem would decide halting through a logical encoding.Rice's theoremRelated: The contradiction in Rice's theorem's proof would decide this problem.Kolmogorov complexityRelated: Deciding exact complexity would solve halting questions for programs within a length bound.Computable functionRelated: Halting determines whether a procedure successfully returns a function value.Many-one reductionRelated: Many-one reductions transfer its undecidability to other decision problems.Universal Turing machineRelated: Universality enables a machine to represent arbitrary computations, including those whose termination cannot be decided in general.Deterministic algorithmRelated: Deterministic execution can still continue forever rather than produce an output.Diagonal argumentRelated: A diagonal argument shows that no algorithm solves this decision problem for all programs.Hilbert's tenth problemRelated: An undecidable halting question can be translated into a question about integer solutions.Automata theoryRelated: Its undecidability demonstrates a fundamental limit of Turing-machine computation.Kleene's recursion theoremRelated: Self-reference from the theorem supports diagonal arguments related to halting undecidability.Computable numberRelated: Undecidability of halting underlies prominent constructions of noncomputable real numbers.General recursive functionRelated: A minimization search may fail to terminate, reflecting undecidable halting behavior.Turing degreeRelated: Its degree is the first Turing jump above the computable degree.Trakhtenbrot's theoremRelated: A reduction from halting explains why no algorithm decides finite satisfiability.
KnowraHalting problemLinked fromLinked fromThe 32 pages that link to Halting problem, each with the reason it gives.All 32Broader topic 12Related 18Compared with 2Gödel's incompleteness theoremsRelated: The computational translation of incompleteness into a concrete algorithmic impossibility.Church–Turing thesisRelated: The thesis concerns what algorithms can compute, including limits proved within the model.Gödel numberingRelated: Numerical codes for programs make it possible to formulate and prove undecidability results arithmetically.EntscheidungsproblemRelated: A hypothetical solution to the Entscheidungsproblem would decide halting through a logical encoding.Rice's theoremRelated: The contradiction in Rice's theorem's proof would decide this problem.Kolmogorov complexityRelated: Deciding exact complexity would solve halting questions for programs within a length bound.Computable functionRelated: Halting determines whether a procedure successfully returns a function value.Many-one reductionRelated: Many-one reductions transfer its undecidability to other decision problems.Universal Turing machineRelated: Universality enables a machine to represent arbitrary computations, including those whose termination cannot be decided in general.Deterministic algorithmRelated: Deterministic execution can still continue forever rather than produce an output.Diagonal argumentRelated: A diagonal argument shows that no algorithm solves this decision problem for all programs.Hilbert's tenth problemRelated: An undecidable halting question can be translated into a question about integer solutions.Automata theoryRelated: Its undecidability demonstrates a fundamental limit of Turing-machine computation.Kleene's recursion theoremRelated: Self-reference from the theorem supports diagonal arguments related to halting undecidability.Computable numberRelated: Undecidability of halting underlies prominent constructions of noncomputable real numbers.General recursive functionRelated: A minimization search may fail to terminate, reflecting undecidable halting behavior.Turing degreeRelated: Its degree is the first Turing jump above the computable degree.Trakhtenbrot's theoremRelated: A reduction from halting explains why no algorithm decides finite satisfiability.