AFTD Auto-Formalizing Theoretical Domains

Turing.TransitionOut

structureimported Lean

The output of the transition function.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Relation in
variable {k : ℕ} {State Symbol : Type*} in
structure Turing.TransitionOut (k : ℕ) (Symbol State : Type*)
Defined in
CSLib, `Turing.TransitionOut`
Lean proof
By Christian Reitwiessner, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Christian Reitwiessner. 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
Used by 1
  • Turing.MultiTapeTMA multi-tape Turing machine with k work tapes over the alphabet of Option Symbol (where none is the blank BiTape symbol). Note…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Relation in
variable {k : ℕ} {State Symbol : Type*} in
/-- The output of the transition function. -/
structure Turing.TransitionOut (k : ℕ) (Symbol State : Type*) where
  /-- The movement (attempt) of the input head. -/
  inputMove : SignType
  /-- Actions on the work tapes: optionally a symbol to write and the head movement. -/
  workActions : Fin k → (Option (Option Symbol)) × SignType
  /-- An optional symbol to output. -/
  outS : Option Symbol
  /-- The successor state or none to halt. -/
  q' : Option State
See it in the graphDiscuss this resultChallenge it