Mathlib Map

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.

Defined in
Mathlib.Computability.TuringMachine.PostTuringMachine
Cited by
1 results in Mathlib
Foundations
Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
InhabitedInhabited

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.

Cited by1

Results whose statement or proof uses this declaration.