Theorems · Definition · logic and foundations
Turing.TM0.eval
{Γ : Type u_1} →
{Λ : Type u_2} →
[inst : Inhabited Λ] → [inst_1 : Inhabited Γ] → Turing.TM0.Machine Γ Λ → List Γ → Part (Turing.ListBlank Γ)Evaluate a Turing machine on initial input to a final state, if it terminates.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Partstatement · cited by 325
- Turing.ListBlankstatement · cited by 68
- Part.mapproof · cited by 65
- StateTransition.evalproof · cited by 16
- Turing.TM0.Cfgproof · cited by 10
- Turing.Tape.right₀proof · cited by 7
- Turing.TM0.stepproof · cited by 6
- Turing.TM0.Machinestatement and proof · cited by 5
- Turing.TM0.Cfg.Tapeproof · cited by 2
- Turing.TM0.initproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Turing.TM1to0.tr_evalstatement · cited by 0