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

7, 9, 11, 11, 9, 13, 15, 13, 7, 11, 13, 15, 11, 17, 19, 15, 7, 9, 11, 13, 9, 15, 17, 17, 7, 13, 15, 19, 13, 21, 23, 17, 7, 9, 11, 11, 9, 13, 15, 15, 7, 11, 13, 17, 11, 19, 21, 19, 7, 9, 11, 15, 9, 17, 19, 21, 7, 15, 17, 23, 15, 25, 27, 19, 7, 9, 11, 11, 9, 13

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 = 120}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{3111, 2, 2}, {1, lim}, lim, "Steps"] ] (* Michael De Vlieger, Feb 07 2026, after 5th example in Wolfram article *)

Crossrefs

Sequence in context: A058483 A176326 A387226 * A283056 A162308 A383288

Adjacent sequences: A393187 A393188 A393189 * A393191 A393192 A393193

Keyword

nonn

Author

Sean A. Irvine, Feb 04 2026

Status

approved