MultiwayTuringMachineFunction[Sequence@@ndtm,i,ndtmax]
In[]:=
OneSidedTuringMachineMultiwayGraph[{2253,2319},1,10]
Out[]=
In[]:=
Table[RulePlot[TuringMachine[{m,1,2}]],{m,0,15}]
Out[]=

,
,
,
,
,
,
,
,
,
,
,
,
,
,
,

In[]:=
Table[RulePlot[TuringMachine[{m,1,1}]],{m,0,1}]
Out[]=

,

TuringMachineRuleCases[]
ResourceObject
:The ResourceObject TuringMachineRuleCases could not be found.
Out[]=
$Failed
In[]:=
Table[OneSidedTuringMachineMultiwayGraph[{TuringMachineRuleCases@{m1,1,1},TuringMachineRuleCases@{m2,1,1}},0,10,VertexShapeFunction->{_->None},VertexLabels->{_->None}],{m1,0,1},{m2,0,1}]
Out[]=

,
,
,

In[]:=
Table[OneSidedTuringMachineMultiwayGraph[{TuringMachineRuleCases@{m1,1,2},TuringMachineRuleCases@{m2,1,2}},1,3],{m1,0,3},{m2,0,3}]
Out[]=

,
,
,
,
,
,
,
,
,
,
,
,
,
,
,

In[]:=
ListPlot[First[MultiwayTuringMachineFunction[Range[0,15],1,2,1,8]],Frame->True,FrameLabel->{"step number","output value"},PlotRange->All]
Out[]=
OneSidedMultiwayTuringMachineFunction[{{rn1,rn2},s,k},inputs,maxsteps]
OneSidedMultiwayTuringMachineFunction[{{rn1,rn2},s,k},inputs,maxsteps]
i->{o1,o2,o3,Undefined,Undefined,...}
"AllSteps"{{t11,t12},{t21},{t31,t32},Infinity,Infinity,...}
"Steps"{t12,t21,t31}(*minvalues*)
In[]:=
OneSidedTuringMachineMultiwayGraph[{2253,2319},1,10,"Width"->11]
Out[]=

s=2, k=2

Searching for NDTMs

Does the output set for an NDTM include the actual output for the DTM for a given input?
This asks for shorter runtime:

Search for MW emulation of exponential rules

Can we search pairs of {2,2} rules?

Exponential

1342057

889249

1073017

Junior Everything Machines

For each input value, what is the distribution of times to get each output value?
Distribution of values reached at a given runtime

Everything machines

This generates all binary sequences...
To get to value v ... 2 Floor[Log2[v]]
A DTM will follow a particular path.... All possible DTMs will also make a definite ball....