Mathlib Map

Theorems · Definition · logic and foundations

Turing.TM0.Cfg.map

{Γ : Type u_1} →
  [inst : Inhabited Γ] →
    {Γ' : Type u_2} →
      [inst_1 : Inhabited Γ'] →
        {Λ : Type u_3} → {Λ' : Type u_4} → Turing.PointedMap Γ Γ' → (Λ → Λ') → Turing.TM0.Cfg Γ Λ → Turing.TM0.Cfg Γ' Λ'

Map a configuration across a function, given f : Γ → Γ' a map of the alphabets and g : Λ → Λ' a map of the machine states.

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

Around this declaration

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

Turing.TM0.Machine.map_step · cited by 1Machine.map_stepTuring.TM0.map_init · cited by 0TM0.map_initTuring.TM0.Machine.map_respects · cited by 0Machine.map_respectsTuring.Tape · cited by 50Turing.TapeTuring.PointedMap · cited by 24Turing.PointedMapTuring.TM0.Cfg · cited by 10TM0.CfgTuring.Tape.map · cited by 7Tape.mapCfg.mapCITED BYCITES

Cites4

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

Cited by3

Results whose statement or proof uses this declaration.