Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`TuringMachine`
MultiwayTuringMachineFunction  |
|
| | ||||
|
| | ||||
|
| | ||||
▪
A multiway machine is given by a list of integer rule numbers; where their transitions disagree the traversal branches, so one input can lead to many histories.
▪
The result is a triple : the unique tape values reached from halted branches, the number of active branches at each step, and whether the traversal stopped on a detected cycle.
{haltedValues,branches,cycleQ}
▪
haltedValues
▪
input may be a single integer or a list of integers, and the machine assumes 2 states and 2 colors unless the form is used.
{rules,s,k}
Examples
(2)
Basic Examples
(1)
Traverse the multiway machine built from rules 12 and 13 on input 2 for 6 steps — it runs without halting, so no tape values are collected, the single branch stays active each step, and no cycle is detected:
In[1]:=
 | MultiwayTuringMachineFunction |
Out[1]=
{{},{1,1,1,1,1,1,1},False}
Scope
(1)
 |
|
""