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`
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
R
u
n
t
i
m
e
P
l
o
t
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
R
u
n
t
i
m
e
P
l
o
t
[
{
n
u
m
b
e
r
,
s
,
k
}
,
{
m
i
n
,
m
a
x
}
,
n
]
p
l
o
t
s
t
h
e
r
u
n
n
i
n
g
t
i
m
e
(
n
u
m
b
e
r
o
f
s
t
e
p
s
)
o
f
a
o
n
e
-
s
i
d
e
d
T
u
r
i
n
g
m
a
c
h
i
n
e
a
s
a
f
u
n
c
t
i
o
n
o
f
i
t
s
i
n
p
u
t
,
o
v
e
r
i
n
p
u
t
s
m
i
n
t
h
r
o
u
g
h
m
a
x
r
u
n
f
o
r
a
t
m
o
s
t
n
s
t
e
p
s
.
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
R
u
n
t
i
m
e
P
l
o
t
[
s
t
e
p
s
]
p
l
o
t
s
a
p
r
e
c
o
m
p
u
t
e
d
l
i
s
t
o
f
s
t
e
p
c
o
u
n
t
s
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
The step counts come from
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
with the
"
S
t
e
p
s
"
property; inputs on which the machine does not halt are shown as gaps.
▪
The
"
S
h
o
w
I
n
f
i
n
i
t
y
"
option marks the non-halting inputs explicitly. The value-versus-input companion is
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
, and
T
u
r
i
n
g
M
a
c
h
i
n
e
W
o
r
s
t
C
a
s
e
P
l
o
t
adds a worst-case envelope.
Examples
(
0
)
S
e
e
A
l
s
o
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
▪
T
u
r
i
n
g
M
a
c
h
i
n
e
W
o
r
s
t
C
a
s
e
P
l
o
t
▪
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
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 how long the
s
=3,
k
=2 rule 600720 runs for inputs 1 through 50:
I
n
[
1
]
:
=
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
R
u
n
t
i
m
e
P
l
o
t
[
{
6
0
0
7
2
0
,
3
,
2
}
,
{
1
,
5
0
}
,
2
0
0
]
O
u
t
[
1
]
=
"
"