A393209 Halting time for Wolfram's 2-state 2-symbol Turing machine 1511 when started with n on the tape.

7, 1, 17, 1, 9, 1, 31, 1, 7, 1, 21, 1, 11, 1, 49, 1, 7, 1, 19, 1, 9, 1, 37, 1, 7, 1, 25, 1, 13, 1, 71, 1, 7, 1, 17, 1, 9, 1, 35, 1, 7, 1, 23, 1, 11, 1, 57, 1, 7, 1, 21, 1, 9, 1, 43, 1, 7, 1, 29, 1, 15, 1, 97, 1, 7, 1, 17, 1, 9, 1, 33, 1, 7, 1, 21, 1, 11, 1, 55

Offset

1,1

Comments

See A392245 for example code.

Links

Sean A. Irvine, Table of n, a(n) for n = 1..1000

Stephen Wolfram, P vs. NP and the Difficulty of Computation: A Ruliological Approach, 2026.

Mathematica

With[{lim = 120}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{1511, 2, 2}, {1, lim}, lim, "Steps"] ] (* Michael De Vlieger, Feb 06 2026, after 5th example in "The Basic Setup" in "P vs. NP ..." *)

Crossrefs

Cf. A392245, A393208 (output).

Sequence in context: A317016 A348983 A013614 * A179530 A383039 A098081

Adjacent sequences: A393206 A393207 A393208 * A393210 A393211 A393212

Keyword

nonn

Author

Sean A. Irvine, Feb 05 2026

Status

approved