Theorems · Definition · logic and foundations
Turing.TM0.step
{Γ : Type u_1} →
{Λ : Type u_2} →
[inst : Inhabited Λ] →
[inst_1 : Inhabited Γ] → Turing.TM0.Machine Γ Λ → Turing.TM0.Cfg Γ Λ → Option (Turing.TM0.Cfg Γ Λ)Execution semantics of the Turing machine.
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Turing.Tapeproof · cited by 50
- Turing.Dirproof · cited by 30
- Turing.Tape.moveproof · cited by 25
- Turing.Tape.headproof · cited by 17
- Turing.TM0.Stmtproof · cited by 16
- Turing.Tape.writeproof · cited by 14
- Turing.TM0.Cfgstatement and proof · cited by 10
- Turing.TM0.Machinestatement and proof · cited by 5
Cited by8
Results whose statement or proof uses this declaration.
- Turing.TM0.evalproof · cited by 1
- Turing.TM1to0.tr_respectsstatement and proof · cited by 1
- Turing.TM0.step_supportsstatement and proof · cited by 1
- Turing.TM0.Machine.map_stepstatement and proof · cited by 1
- Turing.TM0.Reachesproof · cited by 0
- Turing.TM0to1.tr_respectsstatement and proof · cited by 0
- Turing.TM1to0.tr_evalproof · cited by 0
- Turing.TM0.Machine.map_respectsstatement and proof · cited by 0