A393211 Number computed by Wolfram's 2-state 2-symbol Turing machine 773 when started with n on the tape.

0, 0, 2, 4, 4, 0, 6, 8, 8, 0, 10, 12, 12, 8, 14, 16, 16, 16, 18, 20, 20, 16, 22, 24, 24, 0, 26, 28, 28, 24, 30, 32, 32, 32, 34, 36, 36, 32, 38, 40, 40, 0, 42, 44, 44, 40, 46, 48, 48, 48, 50, 52, 52, 48, 54, 56, 56, 32, 58, 60, 60, 56, 62, 64, 64, 64, 66, 68

Offset

1,3

Comments

Also computed by machines 897 and 919.

The function is total (i.e., the computation terminates for all inputs n).

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"][{773, 2, 2}, {1, lim}, lim] ] (* Michael De Vlieger, Feb 06 2026, after 3rd example in "The Basic Setup" in "P vs. NP ..." *)

Crossrefs

Cf. A392245, A393212 (halting time for 773), A393232 (halting time for 897), A393233 (halting time for 919).

Sequence in context: A197827 A352452 A195479 * A393307 A112793 A372037

Adjacent sequences: A393208 A393209 A393210 * A393212 A393213 A393214

Keyword

nonn

Author

Sean A. Irvine, Feb 06 2026

Status

approved