A390016 Maximum halting time across all Wolfram 3-state 2-symbol Turning machines started with n on the tape.

53, 159, 95, 161, 161, 95, 179, 149, 219, 1021, 269, 179, 215, 153, 531, 251, 297, 375, 295, 2905, 1023, 513, 1283, 169, 293, 5419, 323, 229, 255, 173, 1441, 507, 795, 249, 209, 281, 1291, 1589, 1591, 247, 3085, 6503, 1179, 4959, 591, 791, 5609, 281, 277, 183

Offset

1,1

Comments

Only computations which halt are considered.

These maximum times have been checked to 10^8 for n<=20 and at least 10^5 for n>20 (computations longer than that were assumed infinite).

Links

Table of n, a(n) for n=1..50.

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

Crossrefs

Cf. A393317.

Sequence in context: A053070 A140655 A142508 * A279259 A142639 A141880

Adjacent sequences: A390013 A390014 A390015 * A390017 A390018 A390019

Keyword

nonn

Author

Sean A. Irvine, Feb 12 2026

Status

approved