OFFSET
1,1
COMMENTS
The Turing machine computing this sequence uses the 5-tuple instruction table:
[State, Character, New State, New Character, Direction]
{1,_ 1,_,>} {1,1 1,1,>} {1,- 1,-,>} {1,= 2,_,<} {2,1 3,=,<}
{2,- H,_,<} {3,1 3,1,<} {3,- 4,-,<} {4,_ 4,_,<} {4,1 1,_,>}
(Suzanne Britton), with the read-write head beginning at canonical position.
LINKS
Michael S. Branicky, Python TM Simulation Code
S. Britton, Turing Machine Simulator [Dead link]
M. Ugarte, Turing Machine Simulator
FORMULA
a(n) = prime(n+1)-prime(n)+(2*prime(n)+3)*(prime(n)+1) because when started with input string 1^q - 1^p =, with q >= p, the Turing machine halts with 1^(q-p) on its tape after (q-p)+(2*p+3)*(p+1) steps. - Michael S. Branicky, Jul 04 2020
PROG
(Python) # See Branicky link
CROSSREFS
KEYWORD
nonn
AUTHOR
Jason Earls, Dec 10 2002
EXTENSIONS
Terms beyond a(9) from Michael S. Branicky, Jul 04 2020
STATUS
approved