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

11, 5, 23, 3, 47, 7, 39, 3, 13, 5, 269, 3, 19, 9, 59, 3, 11, 5, 99, 3, 67, 7, 1283, 3, 15, 5, 35, 3, 95, 11, 83, 3, 11, 5, 25, 3, 1291, 7, 521, 3, 13, 5, 381, 3, 21, 9, 5609, 3, 11, 5, 31, 3, 91, 7, 55, 3, 17, 5, 517, 3, 27, 13, 111, 3, 11, 5, 23, 3, 529, 7

Offset

1,1

Comments

Has asymptotic runtime 4^n [Wolfram].

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

Crossrefs

Cf. A393533, A393507.

Sequence in context: A127820 A168206 A120831 * A385709 A253254 A373730

Adjacent sequences: A393531 A393532 A393533 * A393535 A393536 A393537

Keyword

nonn

Author

Sean A. Irvine, Feb 18 2026

Status

approved