- Gotta love arxiv.
I take that paper quite seriously. That initial def is relative to the language (of course). But reducible to universal turing machine L (as he goes on to prove a bit further down.) Note the the "+ O(1)" / "+ c". That's the language relative bit and it is O(1). http://bit.ly/IooFpk The above is quite elegant and to the point. K_sub_L is the irreducible universal construct. K_sub_L_prime the interpreter. If it helps, consider that number has no (representational) "base" but numeric form does. So, as an analogy, one can say Na > Nb. Naturally the inequality will hold in Na_base_x > Nb_base_x. Various bases will result in distinct length of the form. If further helps, consider the notion of image and its distinction from essence.It seems so language dependent