Cslib.Computability.Turing.SingleTape.SingleTapeNTM
structureimported Lean
A (single-tape) Nondeterministic Turing Machine (NTM) is a nondeterministic automaton equipped with a set of accepting halting states.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Automata in structure Cslib.Computability.Turing.SingleTape.SingleTapeNTM (State Symbol : Type*) extends NA State (TrLabel Symbol)
- Defined in
- CSLib, `Cslib.Computability.Turing.SingleTape.SingleTapeNTM`
- Lean proof
- By Fabrizio Montesi, 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.SingleTapeNTM← Cslib.Computability.Turing.SingleTape.SingleTapeNTM (Cslib/Computability/Machines/Turing/SingleTape/NonDeterministic.lean:34): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- Cslib.Automata.NAA nondeterministic automaton extends a
LTSwith a set of initial states. - Cslib.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled… - Cslib.Computability.Turing.SingleTape.TrLabelThe transition labels used by a single-tape Turing Machine.
- Cslib.Automata.NAA nondeterministic automaton extends a
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Automata in /-- A (single-tape) Nondeterministic Turing Machine (NTM) is a nondeterministic automaton equipped with a set of accepting halting states. -/ structure Cslib.Computability.Turing.SingleTape.SingleTapeNTM (State Symbol : Type*) extends NA State (TrLabel Symbol) where /-- The set of accepting states. -/ accept : Set State /-- Proof that all accepting states are halting states. -/ accept_halting (hmem : s ∈ accept) : ¬∃ μ s', Tr s μ s'