AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.SingleTapeTM.OutputsWithinTime

defimported Lean

A proof of tm outputting l' on input l in at most m steps.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.SingleTapeTM in
open Relation in
open Cslib.Turing.BiTape Cslib.Turing.StackTape in
open _root_.Turing in
variable {Symbol : Type} in
variable [Inhabited Symbol] [Fintype Symbol] in
def Cslib.Turing.SingleTapeTM.OutputsWithinTime (tm : SingleTapeTM Symbol) (l l' : List Symbol) (m : ℕ)
Defined in
CSLib, `Cslib.Turing.SingleTapeTM.OutputsWithinTime`
Lean proof
By Bolton Bailey, Pim Spelier, Daan van Gent, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Bolton Bailey. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 29
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.SingleTapeTM in
open Relation in
open Cslib.Turing.BiTape Cslib.Turing.StackTape in
open _root_.Turing in
variable {Symbol : Type} in
variable [Inhabited Symbol] [Fintype Symbol] in
/-- A proof of `tm` outputting `l'` on input `l` in at most `m` steps. -/
def Cslib.Turing.SingleTapeTM.OutputsWithinTime (tm : SingleTapeTM Symbol) (l l' : List Symbol) (m : ℕ) :=
  RelatesWithinSteps tm.TransitionRelation (initCfg tm l) (haltCfg tm l') m
See it in the graphDiscuss this resultChallenge it