<s>
A	O
Post	B-Application
–	I-Application
Turing	I-Application
machine	I-Application
is	O
a	O
"	O
program	O
formulation	O
"	O
of	O
a	O
type	O
of	O
Turing	B-Architecture
machine	I-Architecture
,	O
comprising	O
a	O
variant	O
of	O
Emil	O
Post	O
's	O
Turing-equivalent	B-Algorithm
model	O
of	O
computation	O
.	O
</s>
<s>
A	O
Post	B-Application
–	I-Application
Turing	I-Application
machine	I-Application
uses	O
a	O
binary	O
alphabet	O
,	O
an	O
infinite	O
sequence	O
of	O
binary	O
storage	B-General_Concept
locations	O
,	O
and	O
a	O
primitive	O
programming	O
language	O
with	O
instructions	O
for	O
bi-directional	O
movement	O
among	O
the	O
storage	B-General_Concept
locations	O
and	O
alteration	O
of	O
their	O
contents	O
one	O
at	O
a	O
time	O
.	O
</s>
<s>
The	O
names	O
"	O
Post	O
–	O
Turing	O
program	O
"	O
and	O
"	O
Post	B-Application
–	I-Application
Turing	I-Application
machine	I-Application
"	O
were	O
used	O
by	O
Martin	O
Davis	O
in	O
1973	O
–	O
1974	O
(	O
Davis	O
1973	O
,	O
p.69ff	O
)	O
.	O
</s>
<s>
As	O
briefly	O
mentioned	O
in	O
the	O
article	O
Turing	B-Architecture
machine	I-Architecture
,	O
Post	O
,	O
in	O
his	O
paper	O
of	O
1947	O
(	O
Recursive	O
Unsolvability	O
of	O
a	O
Problem	O
of	O
Thue	O
)	O
atomized	O
the	O
Turing	O
5-tuples	O
to	O
4-tuples	O
:	O
</s>
<s>
Any	O
binary-tape	O
Turing	B-Architecture
machine	I-Architecture
is	O
readily	O
converted	O
to	O
an	O
equivalent	O
"	O
Wang	O
program	O
"	O
using	O
the	O
above	O
instructions	O
.	O
</s>
<s>
This	O
is	O
the	O
model	O
to	O
which	O
Davis	O
formally	O
applied	O
the	O
name	O
"	O
Post	B-Application
–	I-Application
Turing	I-Application
machine	I-Application
"	O
with	O
its	O
"	O
Post	O
–	O
Turing	O
language	O
"	O
.	O
</s>
<s>
Per	O
the	O
Post	B-Application
–	I-Application
Turing	I-Application
machine	I-Application
conventions	O
each	O
of	O
the	O
Print	O
,	O
Erase	O
,	O
Left	O
,	O
and	O
Right	O
instructions	O
consist	O
of	O
two	O
actions	O
:	O
</s>
<s>
And	O
per	O
the	O
Post	B-Application
–	I-Application
Turing	I-Application
machine	I-Application
conventions	O
the	O
conditional	O
"	O
jumps	O
"	O
J0xxx	O
,	O
J1xxx	O
consist	O
of	O
two	O
actions	O
:	O
</s>
<s>
And	O
per	O
the	O
Post	B-Application
–	I-Application
Turing	I-Application
machine	I-Application
conventions	O
the	O
unconditional	O
"	O
jump	O
"	O
Jxxx	O
consists	O
of	O
a	O
single	O
action	O
,	O
or	O
if	O
we	O
want	O
to	O
regularize	O
the	O
2-action	O
sequence	O
:	O
</s>
