Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Increasing limits of bounded evaluators — definitions

Lax755887.LimitDecider · concepts/Lax755887/LimitDecider.lean · lax-755887

definition

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

    Definition

    Bounded acceptance is computable and increases with fuel. Its union is the halting predicate; computability does not pass to this increasing limit.

    Concept map
    1 concept; 3 descendants hidden
    100%
    Proven claimOpen claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Lean source view on GitHub

    1import Mathlib
    2
    3/-!
    4---
    5title: Increasing limits of bounded evaluators — definitions
    6type: definition
    7---
    8Bounded acceptance is computable and increases with fuel. Its union is the halting predicate; computability does not pass to this increasing limit.
    9-/
    10
    11namespace Lax755887.LimitDecider
    12
    13open Nat.Partrec (Code)
    14open Nat.Partrec.Code
    15
    16def Accepted (fuel : ℕ) (code : Code) : Prop := (evaln fuel code 0).isSome = true
    17
    18end Lax755887.LimitDecider
    19
    Builds on

    none

    Used by
    From Mathlib

    Discussion

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

    Loading discussion…