A390016 - OEIS

%I #22 Feb 16 2026 22:59:06

%S 53,159,95,161,161,95,179,149,219,1021,269,179,215,153,531,251,297,

%T 375,295,2905,1023,513,1283,169,293,5419,323,229,255,173,1441,507,795,

%U 249,209,281,1291,1589,1591,247,3085,6503,1179,4959,591,791,5609,281,277,183

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

%C Only computations which halt are considered.

%C 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).

%H Stephen Wolfram, <a href="https://writings.stephenwolfram.com/2026/01/p-vs-np-and-the-difficulty-of-computation-a-ruliological-approach/">P vs. NP and the Difficulty of Computation: A Ruliological Approach</a>, 2026.

%Y Cf. A393317.

%K nonn

%O 1,1

%A _Sean A. Irvine_, Feb 12 2026