1,1

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.

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.

Abelard, On Computable Numbers, with an Application to the Entscheidungsproblem, By A. M. Turing

S. Britton, Turing Machine Simulator

Cf. A001223.

Adjacent sequences: A078609 A078610 A078611 this_sequence A078613 A078614 A078615

Sequence in context: A063252 A078540 A057836 this_sequence A039373 A043196 A043976

more,nonn

Jason Earls (zevi_35711(AT)yahoo.com), Dec 10 2002