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

1, 9, 1, 3, 1, 7, 1, 3, 1, 15, 1, 3, 1, 7, 1, 3, 1, 9, 1, 3, 1, 7, 1, 3, 1, 13, 1, 3, 1, 7, 1, 3, 1, 9, 1, 3, 1, 7, 1, 3, 1, 21, 1, 3, 1, 7, 1, 3, 1, 9, 1, 3, 1, 7, 1, 3, 1, 13, 1, 3, 1, 7, 1, 3, 1, 9, 1, 3, 1, 7, 1, 3, 1, 15, 1, 3, 1, 7, 1, 3, 1, 9, 1, 3, 1

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"][{897, 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, A393233.

Sequence in context: A154490 A051995 A198835 * A010167 A154181 A334479

Adjacent sequences: A393229 A393230 A393231 * A393233 A393234 A393235

Keyword

nonn

Author

Sean A. Irvine, Feb 06 2026

Status

approved