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

7, 17, 11, 31, 9, 23, 15, 49, 7, 21, 13, 39, 11, 29, 19, 71, 7, 19, 11, 37, 9, 27, 17, 59, 7, 25, 15, 47, 13, 35, 23, 97, 7, 17, 11, 35, 9, 25, 15, 57, 7, 23, 13, 45, 11, 33, 21, 83, 7, 21, 11, 43, 9, 31, 19, 69, 7, 29, 17, 55, 15, 41, 27, 127, 7, 17, 11, 33

Offset

1,1

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 = 10000}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{3239, 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. A393189 (function computed).

Sequence in context: A156680 A107804 A276809 * A274916 A128713 A283163

Adjacent sequences: A393231 A393232 A393233 * A393235 A393236 A393237

Keyword

nonn

Author

Sean A. Irvine, Feb 06 2026

Status

approved