|
%I
%S 0,48,28560,47045880,152587890624,819628286980800,6582952005840035280,
%T 73885357344138503765448,1104427674243920646305299200,
%U 21209401372879911350250244140624,508858109619679129936596364708525200
%N Total number of machines with n states in "On the Running Time of the Shortest Programs"
%C The Kolmogorov complexity of the word w is equal to the length of the shortest concatenation of program Z and its input x with which the word w is computed by the universal Turing machine U. The question introduced in this paper is the following: How long do the shortest programs run for?
%H Norbert Batfai, <a href="http://arxiv.org/abs/0908.1159">On the Running Time of the Shortest Programs</a>, Aug 10, 2009.
%F a(n) = ((6*n + 1)^(2*n)) - 1.
%Y Cf. A028444.
%K easy,nonn,uned
%O 0,2
%A _Jonathan Vos Post_, Aug 11 2009
|
