A391977 Maximum value computed by any of the 4096 Wolfram 2-state 2-symbol Turing machines when started with n on the tape.

31, 255, 127, 127, 511, 63, 511, 511, 127, 2047, 1023, 255, 127, 1023, 2047, 2047, 63, 511, 255, 2047, 4095, 255, 2047, 1023, 127, 1023, 511, 511, 2047, 255, 8191, 8191, 127, 127, 1023, 511, 1023, 127, 1023, 1023, 4095, 65535, 8191, 511, 511, 8191, 4095, 4095

Offset

1,1

Comments

Only computations which halt are considered.

Not all values are of the form 2^k-1. For example, a(265) = 383.

Links

Sean A. Irvine, Table of n, a(n) for n = 1..500

Stephen Wolfram, P vs. NP and the Difficulty of Computation: A Ruliological Approach, 2026.

Crossrefs

Cf. A393376, A393317.

Sequence in context: A042872 A142623 A089705 * A180471 A125368 A126526

Adjacent sequences: A391974 A391975 A391976 * A391978 A391979 A391980

Keyword

nonn

Author

Sean A. Irvine, Feb 11 2026

Status

approved