AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.SingleTapeTM.PolyTimeComputable

structureimported Lean

A Turing machine + a polynomial 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
open Polynomial in
structure Cslib.Turing.SingleTapeTM.PolyTimeComputable (f : List Symbol → List Symbol) extends TimeComputable f
Defined in
CSLib, `Cslib.Turing.SingleTapeTM.PolyTimeComputable`
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 28
Used by 1

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
open Polynomial in
/-- A Turing machine + a polynomial time function + a proof it outputs `f` in at most `time(input.length)` steps. -/
structure Cslib.Turing.SingleTapeTM.PolyTimeComputable (f : List Symbol → List Symbol) extends TimeComputable f where
  /-- a polynomial time bound -/
  poly : Polynomial ℕ
  /-- proof that this machine outputs `f` in at most `time(input.length)` steps -/
  bounds : ∀ n, timeBound n ≤ poly.eval n
See it in the graphDiscuss this resultChallenge it