Page "Kolmogorov complexity" Paragraph 59
from
Wikipedia
where C is the " overhead " added by the program GenerateParadoxicalString.
Since n grows faster than log < sub > 2 </ sub >( n ), there must exist a value n < sub > 0 </ sub > such that
Page 1 of 1.
2.171 seconds.