Mathlib Map

Theorems · Definition · logic and foundations

Turing.TM2to1.addBottom

{K : Type u_1} →
  {Γ : K → Type u_2} → Turing.ListBlank ((k : K) → Option (Γ k)) → Turing.ListBlank (Turing.TM2to1.Γ' K Γ)

The bottom marker is fixed throughout the calculation, so we use the addBottom function to express the program state in terms of a tape with only the stacks themselves.

Defined in
Mathlib.Computability.TuringMachine.StackTuringMachine
Cited by
12 results in Mathlib
Foundations
Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by14

Results whose statement or proof uses this declaration.