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

13, 1, 11, 1, 27, 1, 25, 1, 15, 1, 13, 1, 21, 1, 19, 1, 13, 1, 11, 1, 45, 1, 43, 1, 17, 1, 15, 1, 39, 1, 37, 1, 13, 1, 11, 1, 29, 1, 27, 1, 15, 1, 13, 1, 23, 1, 21, 1, 13, 1, 11, 1, 35, 1, 33, 1, 19, 1, 17, 1, 29, 1, 27, 1, 13, 1, 11, 1, 27, 1, 25, 1, 15, 1

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 = 120}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{3555, 2, 2}, {1, lim}, lim, "Steps"] ] (* Michael De Vlieger, Feb 10 2026, after 5th example in the Wolfram link *)

Crossrefs

Cf. A393304.

Sequence in context: A202134 A185409 A010235 * A196381 A013570 A010236

Adjacent sequences: A393302 A393303 A393304 * A393306 A393307 A393308

Keyword

nonn

Author

Sean A. Irvine, Feb 10 2026

Status

approved