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

1, 9, 1, 5, 1, 5, 1, 5, 1, 13, 1, 5, 1, 5, 1, 5, 1, 9, 1, 5, 1, 5, 1, 5, 1, 9, 1, 5, 1, 5, 1, 5, 1, 9, 1, 5, 1, 5, 1, 5, 1, 17, 1, 5, 1, 5, 1, 5, 1, 9, 1, 5, 1, 5, 1, 5, 1, 9, 1, 5, 1, 5, 1, 5, 1, 9, 1, 5, 1, 5, 1, 5, 1, 13, 1, 5, 1, 5, 1, 5, 1, 9, 1, 5, 1, 5

Offset

1,2

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"][{919, 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. A303211 (function computed), A393212, A393232.

Sequence in context: A010168 A388571 A388939 * A340004 A327963 A328112

Adjacent sequences: A393230 A393231 A393232 * A393234 A393235 A393236

Keyword

nonn

Author

Sean A. Irvine, Feb 06 2026

Status

approved