Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`TuringMachine`
MultiwayTuringMachineRules  |
| {state,symbol} {nextState,writeSymbol,direction} | |
| |
▪
A multiway machine is given by a list of integer rule numbers; each rule contributes its transitions, and the union is what makes the machine nondeterministic.
▪
A that maps to more than one triple is a branching point: the machine can take any of those transitions. This is the multivalued counterpart of .
{state,symbol}
Examples
(0)
 |
|
The transition table of the multiway machine built from rules 12 and 13 (2 states, 2 colors) — the cell carries two transitions:
{2,0}
In[1]:=
 | MultiwayTuringMachineRules |
Out[1]=
{{1,0}{{1,0,-1}},{1,1}{{1,0,-1}},{2,0}{{2,0,-1},{2,0,1}},{2,1}{{1,0,1}}}
""