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
F
u
n
c
t
i
o
n
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
[
r
u
l
e
s
,
i
n
p
u
t
,
n
]
t
r
a
v
e
r
s
e
s
t
h
e
n
o
n
d
e
t
e
r
m
i
n
i
s
t
i
c
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
l
i
s
t
o
f
i
n
t
e
g
e
r
r
u
l
e
s
o
n
i
n
p
u
t
f
o
r
a
t
m
o
s
t
n
s
t
e
p
s
(
a
s
s
u
m
i
n
g
2
s
t
a
t
e
s
,
2
s
y
m
b
o
l
s
)
.
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
[
{
r
u
l
e
s
,
s
,
k
}
,
i
n
p
u
t
,
n
]
s
p
e
c
i
f
i
e
s
t
h
e
n
u
m
b
e
r
o
f
s
t
a
t
e
s
s
a
n
d
s
y
m
b
o
l
s
k
.
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
[
{
r
u
l
e
s
,
s
,
k
}
,
i
n
p
u
t
,
t
a
r
g
e
t
,
n
]
s
t
o
p
s
e
a
r
l
y
i
f
t
h
e
t
a
r
g
e
t
o
u
t
p
u
t
i
s
f
o
u
n
d
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
Examples
(
1
)
Scope
(
1
)
Pass several inputs at once; the branch count traces how the three initial histories merge as the traversal proceeds:
I
n
[
1
]
:
=
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
[
{
1
2
,
1
3
}
,
{
1
,
2
,
3
}
,
6
]
O
u
t
[
1
]
=
{
{
}
,
{
3
,
3
,
2
,
1
,
1
,
1
,
1
}
,
F
a
l
s
e
}
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
R
u
l
e
s
▪
M
u
l
t
i
w
a
y
N
o
n
H
a
l
t
e
d
S
t
a
t
e
s
L
e
f
t
▪
N
o
n
T
e
r
m
i
n
a
t
i
n
g
T
u
r
i
n
g
M
a
c
h
i
n
e
Q
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
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:
I
n
[
1
]
:
=
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
[
{
1
2
,
1
3
}
,
2
,
6
]
O
u
t
[
1
]
=
{
{
}
,
{
1
,
1
,
1
,
1
,
1
,
1
,
1
}
,
F
a
l
s
e
}
"
"