Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Learn More about
Wolfram Language
TuringMachine
Guides
TuringMachine
Tech Notes
Exploring One-Sided Turing Machines
Symbols
MultiwayNonHaltedStatesLeft
MultiwayTuringMachineFunction
MultiwayTuringMachinePlot
MultiwayTuringMachineRules
NonTerminatingTuringMachineQ
OneSidedTuringMachineEvolution
OneSidedTuringMachineFind
OneSidedTuringMachineFunction
OneSidedTuringMachineFunctionPlot
OneSidedTuringMachinePlot
OneSidedTuringMachineRuntimePlot
TuringMachineOutput
TuringMachineOutputWithStepsFloat
TuringMachineOutputWithSteps
TuringMachineOutputWithStepsWidthsFloat
TuringMachineOutputWithStepsWidths
TuringMachineRuleCases
TuringMachineRuleCount
TuringMachineSteps
TuringMachineStepsWidths
TuringMachineWidths
TuringMachineWorstCasePlot
$PvsNPStyles
Overviews
TuringMachine
WolframInstitute`TuringMachine`
M
u
l
t
i
w
a
y
T
u
r
i
n
g
M
a
c
h
i
n
e
P
l
o
t
M
u
l
t
i
w
a
y
T
u
r
i
n
g
M
a
c
h
i
n
e
P
l
o
t
[
r
u
l
e
s
,
m
a
x
I
n
p
u
t
,
n
]
p
l
o
t
s
t
h
e
t
a
p
e
v
a
l
u
e
s
r
e
a
c
h
a
b
l
e
b
y
t
h
e
m
u
l
t
i
w
a
y
T
u
r
i
n
g
m
a
c
h
i
n
e
d
e
f
i
n
e
d
b
y
t
h
e
i
n
t
e
g
e
r
r
u
l
e
s
f
o
r
i
n
p
u
t
s
1
t
h
r
o
u
g
h
m
a
x
I
n
p
u
t
,
r
u
n
f
o
r
a
t
m
o
s
t
n
s
t
e
p
s
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
The reachable values come from
M
u
l
t
i
w
a
y
T
u
r
i
n
g
M
a
c
h
i
n
e
F
u
n
c
t
i
o
n
; inputs from which no branch halts are marked separately, so the plot doubles as a map of which inputs the multiway machine can resolve.
▪
maxInput
and
n
both default to 10.
Examples
(
0
)
S
e
e
A
l
s
o
M
u
l
t
i
w
a
y
T
u
r
i
n
g
M
a
c
h
i
n
e
F
u
n
c
t
i
o
n
▪
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
F
u
n
c
t
i
o
n
P
l
o
t
▪
M
u
l
t
i
w
a
y
T
u
r
i
n
g
M
a
c
h
i
n
e
R
u
l
e
s
R
e
l
a
t
e
d
G
u
i
d
e
s
▪
T
u
r
i
n
g
M
a
c
h
i
n
e
Plot the values reachable by the multiway machine built from rules 12 and 13 for inputs 1 through 6:
I
n
[
1
]
:
=
M
u
l
t
i
w
a
y
T
u
r
i
n
g
M
a
c
h
i
n
e
P
l
o
t
[
{
1
2
,
1
3
}
,
6
,
1
0
]
O
u
t
[
1
]
=
"
"