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

3, 5, 7, 13, 3, 15, 17, 21, 3, 5, 7, 23, 3, 25, 27, 29, 3, 5, 7, 13, 3, 15, 17, 31, 3, 5, 7, 33, 3, 35, 37, 37, 3, 5, 7, 13, 3, 15, 17, 21, 3, 5, 7, 23, 3, 25, 27, 39, 3, 5, 7, 13, 3, 15, 17, 41, 3, 5, 7, 43, 3, 45, 47, 45, 3, 5, 7, 13, 3, 15, 17, 21, 3, 5, 7

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"][{2205, 2, 2}, {1, lim}, lim, "Steps"] ] (* Michael De Vlieger, Feb 09 2026, after 5th example in the Wolfram link *)

Crossrefs

Cf. A393292.

Sequence in context: A208772 A071810 A373654 * A137576 A379743 A161329

Adjacent sequences: A393288 A393289 A393290 * A393292 A393293 A393294

Keyword

nonn

Author

Sean A. Irvine, Feb 09 2026

Status

approved