2 ms·
One of the fundamental points of Kolmagorov's algorithmic information theory is that the function for the largest number algorithmically representable by n bits
by joe_the_user 16y ago
One of the fundamental points of Kolmagorov's algorithmic information theory is that the function for the largest number algorithmically representable by n bits of information is incomputable.
http://en.wikipedia.org/wiki/Kolmogorov_complexity http://en.wikipedia.org/wiki/Kolmogorov_complexity