Traditionally, the algorithmic information conveyed by is identified with , the size of the shortest halting program of . This makes a lot of sense, because we often want to limit ourselves to programs that at some point allow us to be sure that their output is complete. In the light of the results above, however, one might argue that the ``true'' information content of is actually embodied by the smaller , the size of the smallest nonhalting GTM program for . is not computable in the limit (Theorem 3.1), while is. is between and in a certain sense -- it is ``closer'' to than while being ``just as computable in the limit'' as .

Juergen Schmidhuber 2003-02-13