Lax Lean Archive

The halting problems are undecidable

Lax624099.HaltingUndecidable · concepts/Lax624099/HaltingUndecidable.lean · lax-624099

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    The halting problem of machine instances is not decidable, over any presentation of the machine vocabulary, and neither is the halting of a drawn partial recursive code.

    Concept map
    15 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.

    1 codehalt_not_computable proven

    2 halt_not_computable proven

    Lean source view on GitHub

    1import Lax904597.Problems
    2import Lax904597.Interpretations
    3import Lax904597.Relativized
    4import Lax904597.Classes
    5import Lax624099.Problems
    6import Lax624099.ValueInvention
    7import Lax624099.ClassRE
    8import Lax624099.FiniteSatisfiability
    9import Lax624099.Halting
    10import Lax624099.CodeHalting
    11import Lax624099.PostCorrespondence
    12import Lax624099.ConcreteInstances
    13import Lax904597.Machines
    14
    15/-!
    16---
    17title: The halting problems are undecidable
    18type: theorem
    19---
    20The halting problem of machine instances is not decidable, over any
    21presentation of the machine vocabulary, and neither is the halting of a drawn
    22partial recursive code.
    23-/
    24
    25namespace Lax624099.HaltingUndecidable
    26
    27open FirstOrder FirstOrder.Language
    28open Lax904597.Problems Lax904597.Interpretations Lax904597.Relativized Lax904597.Classes
    29open Lax904597.Machines Lax624099.Problems Lax624099.ValueInvention Lax624099.ClassRE
    30open Lax624099.FiniteSatisfiability
    31open Lax624099.Halting Lax624099.CodeHalting Lax624099.PostCorrespondence
    32open Lax624099.ConcreteInstances
    33
    34/-- The halting problem is undecidable. -/
    35axiom halt_not_computable : ∀ V : FinVocab turing, ¬ComputablePred (DecisionProblem.toPred HALT V)
    36
    37/-- Halting of a drawn code is undecidable. -/
    38axiom codehalt_not_computable : ¬ComputablePred (DecisionProblem.toPred CODEHALT codeVocab)
    39
    40end Lax624099.HaltingUndecidable
    41
    Show ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…