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

71, 1, 7, 843, 1, 13, 3, 1, 3, 179, 1, 75, 8335, 1, 25, 3, 1, 3, 255, 1, 11, 5, 1, 35, 3, 1, 3, 99, 1, 11, 1983, 1, 81, 3, 1, 3, 1143, 1, 847, 77459, 1, 125, 3, 1, 3, 443, 1, 79, 5, 1, 55, 3, 1, 3, 117, 1, 17, 2737, 1, 17, 3, 1, 3, 253, 1, 81, 7, 1, 33, 3, 1

Offset

1,1

Comments

Apparently has asymptotic 9^n runtime.

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 = 71, len = 2^20}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{840971, 2, 3}, {1, lim}, len, "Steps"] ] (* Michael De Vlieger, Feb 25 2026 *)

Crossrefs

Cf. A393688, A393685, A392245.

Sequence in context: A265728 A186073 A087043 * A126648 A126650 A126651

Adjacent sequences: A393681 A393682 A393683 * A393685 A393686 A393687

Keyword

nonn

Author

Sean A. Irvine, Feb 24 2026

Status

approved