Cslib.Turing.SingleTapeTM.initCfg
defimported Lean
The initial configuration corresponding to a list in the input alphabet. Note that the entries of the tape constructed by BiTape.mk₁ are all some values. This is to ensure that distinct lists map to distinct initial configurations.
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] (tm : SingleTapeTM Symbol) in def Cslib.Turing.SingleTapeTM.initCfg (tm : SingleTapeTM Symbol) (s : List Symbol) : tm.Cfg
- Defined in
- CSLib, `Cslib.Turing.SingleTapeTM.initCfg`
- 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.Cslib.Turing.SingleTapeTM.initCfg← Cslib.Turing.SingleTapeTM.initCfg (Cslib/Computability/Machines/Turing/SingleTape/Deterministic.lean:154): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 23
- Cslib.Turing.BiTape.instInhabitedCslib.Turing.BiTape.instInhabited
- Cslib.Turing.StackTape.empty_eq_nilCslib.Turing.StackTape.empty_eq_nil
- Cslib.Turing.BiTape.instEmptyCollectionCslib.Turing.BiTape.instEmptyCollection
- Cslib.Turing.StackTape.cons_none_nil_toListCslib.Turing.StackTape.cons_none_nil_toList
- Cslib.Turing.StackTape.instEmptyCollectionCslib.Turing.StackTape.instEmptyCollection
- Cslib.Turing.StackTape.instInhabitedCslib.Turing.StackTape.instInhabited
- Cslib.Turing.BiTape.empty_eq_nilCslib.Turing.BiTape.empty_eq_nil
- Cslib.Turing.StackTape.length_nilCslib.Turing.StackTape.length_nil
- Cslib.Turing.BiTape.spaceUsed_writeCslib.Turing.BiTape.spaceUsed_write
- Cslib.Turing.BiTape.moveLeft_moveRightCslib.Turing.BiTape.moveLeft_moveRight
- Cslib.Turing.BiTape.moveRight_moveLeftCslib.Turing.BiTape.moveRight_moveLeft
- Cslib.Turing.StackTape.head_consCslib.Turing.StackTape.head_cons
- Cslib.Turing.StackTape.tail_consCslib.Turing.StackTape.tail_cons
- Cslib.Turing.StackTape.cons_some_toListCslib.Turing.StackTape.cons_some_toList
- Cslib.Turing.StackTape.cons_head_tailCslib.Turing.StackTape.cons_head_tail
- Cslib.Turing.SingleTapeTM.stepThe step function corresponding to a
SingleTapeTM. - Cslib.Turing.BiTape.mk₁Given a
ListofSymbols, construct aBiTapeby mapping the list tosomeelements and laying them out to the right side, with the… - Cslib.Turing.BiTapeA structure for bidirectionally-infinite Turing machine tapes that eventually take on blank
nonevalues - Cslib.Turing.StackTape.length_mapSomeCslib.Turing.StackTape.length_mapSome
- Cslib.Turing.StackTape.nil_toListCslib.Turing.StackTape.nil_toList
- Cslib.Turing.SingleTapeTMA single-tape Turing machine over the alphabet of
Option Symbol(wherenoneis the blankBiTapesymbol). - Cslib.Turing.SingleTapeTM.CfgThe configurations of a Turing machine consist of: an
Optional state (or none for the halting state), and aBiTaperepresenting the… - Cslib.Turing.StackTapeAn infinite tape representation using a list of
Optionvalues, where the list is eventuallynone. Represented as a…
- Used by 6
- Cslib.Turing.SingleTapeTM.OutputsWithinTimeA proof of
tmoutputtingl'on inputlin at mostmsteps. - Cslib.Turing.SingleTapeTM.comp_right_relatesWithinStepsSimulation for the second phase of the composed computer. When the second machine runs from start to halt, the composed machine runs from…
- Cslib.Turing.SingleTapeTM.comp_left_relatesWithinStepsSimulation for the first phase of the composed computer. When the first machine runs from start to halt, the composed machine runs from…
- Cslib.Turing.SingleTapeTM.Cfg.spaceUsed_initCfgCslib.Turing.SingleTapeTM.Cfg.spaceUsed_initCfg
- Cslib.Turing.SingleTapeTM.OutputsA proof of
tmoutputtingl'on inputl. - Cslib.Turing.SingleTapeTM.TimeComputable.idThe identity map on Symbol is computable in constant time.
- Cslib.Turing.SingleTapeTM.OutputsWithinTimeA proof of
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] (tm : SingleTapeTM Symbol) in /-- The initial configuration corresponding to a list in the input alphabet. Note that the entries of the tape constructed by `BiTape.mk₁` are all `some` values. This is to ensure that distinct lists map to distinct initial configurations. -/ def Cslib.Turing.SingleTapeTM.initCfg (tm : SingleTapeTM Symbol) (s : List Symbol) : tm.Cfg := ⟨some tm.q₀, BiTape.mk₁ s⟩