Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`TuringMachine`InductiveProofs`
transitionAxiomsFor  |
|
| | ||||
▪
ru is a machine number (interpreted as an s=2, k=2 machine).
▪
Each transition rule becomes one equational axiom relating the tape configuration before and after the step.
{state,symbol}{newState,write,move}
▪
Examples
(1)
Basic Examples
(1)
Render the transition axioms of machine 453:
In[1]:=
 | RenderAxiomGrid |
 | transitionAxiomsFor |
Out[1]=
s | = | s |
s  | = | s |
s | = | s |
s | = | s |
 |
|
""