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
F
i
n
d
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
F
i
n
d
[
r
u
l
e
,
m
a
x
I
n
p
u
t
,
n
,
{
s
,
k
}
]
f
i
n
d
s
a
l
l
s
-
s
t
a
t
e
,
k
-
c
o
l
o
r
r
u
l
e
s
t
h
a
t
r
e
p
r
o
d
u
c
e
t
h
e
o
u
t
p
u
t
s
o
f
r
u
l
e
f
o
r
i
n
p
u
t
s
1
t
o
m
a
x
I
n
p
u
t
,
e
a
c
h
w
i
t
h
i
n
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
F
i
n
d
[
{
{
i
n
p
u
t
,
s
t
e
p
s
,
v
a
l
u
e
}
,
…
}
,
{
s
,
k
}
]
f
i
n
d
s
t
h
e
r
u
l
e
s
m
a
t
c
h
i
n
g
t
h
e
g
i
v
e
n
{
i
n
p
u
t
,
s
t
e
p
s
,
v
a
l
u
e
}
t
r
i
p
l
e
s
.
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
F
i
n
d
[
{
v
a
l
u
e
s
}
,
n
,
{
s
,
k
}
]
f
i
n
d
s
t
h
e
r
u
l
e
s
p
r
o
d
u
c
i
n
g
v
a
l
u
e
s
f
o
r
i
n
p
u
t
s
1
,
2
,
…
,
e
a
c
h
w
i
t
h
i
n
n
s
t
e
p
s
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
Examples
(
1
)
Scope
(
1
)
Count how many
s
=2,
k
=2 rules share that behavior:
I
n
[
1
]
:
=
L
e
n
g
t
h
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
F
i
n
d
[
{
{
1
,
3
,
3
}
,
{
2
,
1
,
3
}
}
,
{
2
,
2
}
]
O
u
t
[
1
]
=
1
3
2
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
▪
T
u
r
i
n
g
M
a
c
h
i
n
e
R
u
l
e
C
o
u
n
t
▪
T
u
r
i
n
g
M
a
c
h
i
n
e
O
u
t
p
u
t
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
Rule 1500's own
s
=2,
k
=2 family reproduces its behavior on inputs 1 and 2, so the search contains the rule itself:
I
n
[
1
]
:
=
M
e
m
b
e
r
Q
O
n
e
S
i
d
e
d
T
u
r
i
n
g
M
a
c
h
i
n
e
F
i
n
d
[
{
{
1
,
3
,
3
}
,
{
2
,
1
,
3
}
}
,
{
2
,
2
}
]
,
1
5
0
0
O
u
t
[
1
]
=
T
r
u
e
"
"