Home
Original Turing Machine Simulator
Proof-of-Concept Turing Machine Simulator
Dominique Charlebois
Contact Information
(External)
Turing Machine: A Proof-of-Concept
A mathematical model of computation describing an abstract machine.
Example Inputs
$\begin{align} \Sigma &= \{0 \} \\ &= \{>, \#, 0, 1 \} \end{align}$
State Diagram Definition
$\Sigma = \{>, \# \}$
$Q = \{\}$
$Q_{nh} = \{\}$
$Q_{h} = \{\}$
State Diagram Input
Alphabet:
Non Halting States:
Halting States:
Transition Table
State
Symbol
Next State
Symbol
Direction
transitions
$q$
$\sigma$
$\delta (q, \sigma)$
Update State Diagram
State Diagram