Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`TuringMachine`InductiveProofs`
DecodeTuringMachineRules  |
|
| | ||||
▪
States are the symbols , , , ; tape colors are , , , . These are the alphabet the rest of the inductive-proof machinery reasons over.
qA
qB
qC
qD
s0
s1
s2
s3
▪
direction is or .
1
-1
▪
The decoding wraps the resource function and relabels its integer states and colors with these symbols.
TuringMachineFromNumber
Examples
(1)
Basic Examples
(1)
Decode the two-state, two-color binary-incrementer machine 453:
In[1]:=
 | DecodeTuringMachineRules |
Out[1]=
{{qA,s1}{qA,s0,-1},{qA,s0}{qB,s1,1},{qB,s1}{qA,s0,-1},{qB,s0}{qB,s0,1}}
 |
|
""