CSE 555 Theory of Computation (2/28) - Organic Origami

Turing Machine Definition
A Turing machine is a 7-tuple (Q, Σ, Γ, δ, q 0 , q a , q r ), where
Q is a finite set (of states).
Σ is a finite set (input alphabet), ⊔ ∉ Γ.
Γ is a finite set (tape alphabet), Σ ⊆ Γ and ⊔ ∈ Γ.
δ : Q × Γ → Q × Γ × {L, R} is a transition function.
q 0 ∈ Q (the start state).
q a ∈ Q (the accept state).
q r ∈ Q (the reject state).