AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.SingleTapeTM.TimeComputable

structureimported Lean

A Turing machine + a time function + a proof it outputs f in at most time(input.length) 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
structure Cslib.Turing.SingleTapeTM.TimeComputable (f : List Symbol → List Symbol)
Defined in
CSLib, `Cslib.Turing.SingleTapeTM.TimeComputable`
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 26
Used by 3

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 Turing machine + a time function + a proof it outputs `f` in at most `time(input.length)` steps. -/
structure Cslib.Turing.SingleTapeTM.TimeComputable (f : List Symbol → List Symbol) where
  /-- the underlying bundled SingleTapeTM -/
  tm : SingleTapeTM Symbol
  /-- a bound on runtime -/
  timeBound : ℕ → ℕ
  /-- proof this machine outputs `f` in at most `timeBound(input.length)` steps -/
  outputsFunInTime (a) : tm.OutputsWithinTime a (f a) (timeBound a.length)
See it in the graphDiscuss this resultChallenge it