AFTD Auto-Formalizing Theoretical Domains

op75_tm2_double_push_machine

def

A finite one-stack TM2 whose single statement pushes true twice and then halts.

Statement

def op75_tm2_double_push_machine : Turing.FinTM2
Source
OP-75 Karp-reduction composition: finite-statement stack-growth bound in the repository TM2 model.
Verified
15 Nov 2026
Axioms
none listed
Used by 1

Lean source view module on GitHub

def op75_tm2_double_push_machine : Turing.FinTM2 where
  K := Unit
  k₀ := ()
  k₁ := ()
  Γ _ := Bool
  Λ := Unit
  main := ()
  σ := Unit
  initialState := ()
  m _ := Turing.TM2.Stmt.push () (fun _ => true)
    (Turing.TM2.Stmt.push () (fun _ => true) Turing.TM2.Stmt.halt)
See it in the graphDiscuss this resultChallenge it