Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax307052.Acceptance

Correctness of the configuration search

concepts/Lax307052/Acceptance.lean · lax-307052

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.

    Concept map

    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lemma

    On space-bounded computations, the recursive configuration search accepts exactly when the original machine does.

    Lean source view on GitHub

    1import Lax307052.ConfigurationGraph
    2
    3/-!
    4---
    5title: Correctness of the configuration search
    6type: lemma
    7---
    8On space-bounded computations, the recursive configuration search accepts
    9exactly when the original machine does.
    10-/
    11
    12namespace Lax307052.Acceptance
    13
    14open Lax434930.PolynomialTime Lax434930.SpaceMachines ConfigurationGraph
    15
    16axiom correct (M : Machine) (w : Word) (s : ℕ) (hs : M.UsesSpace w s) :
    17 SearchAccepts M w s ↔ M.Accepts w
    18
    19end Lax307052.Acceptance
    20
    Show Proof

    Builds on

    Used by

    none

    From Mathlib

    none

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…