Cslib.Computability.Turing.SingleTape.TrLabel
inductiveimported Lean
The transition labels used by a single-tape Turing Machine.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in inductive Cslib.Computability.Turing.SingleTape.TrLabel (Symbol : Type*) /-- Read `x` from the tape. -/
- Defined in
- CSLib, `Cslib.Computability.Turing.SingleTape.TrLabel`
- Lean proof
- By Fabrizio Montesi, Bolton Bailey, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Fabrizio Montesi. 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.Computability.Turing.SingleTape.TrLabel← Cslib.Computability.Turing.SingleTape.TrLabel (Cslib/Computability/Machines/Turing/SingleTape/Defs.lean:18): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 1
- Cslib.Computability.Turing.SingleTape.SingleTapeNTMA (single-tape) Nondeterministic Turing Machine (NTM) is a nondeterministic automaton equipped with a set of accepting halting states.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- The transition labels used by a single-tape Turing Machine. -/ inductive Cslib.Computability.Turing.SingleTape.TrLabel (Symbol : Type*) /-- Read `x` from the tape. -/ | read (x : Symbol) /-- Write `x` on the tape. -/ | write (x : Symbol) /-- Move the head of the tape. -/ | move (d : Turing.Dir) /-- Do nothing. -/ | skip