Throughout this paper we focus on TMs with self-delimiting programs [#!Levin:73a!#,#!Levin:74!#,#!Gacs:74!#,#!Chaitin:75!#]. Traditionally, the Kolmogorov complexity [#!Kolmogorov:65!#,#!Solomonoff:64!#,#!Chaitin:69!#] or algorithmic complexity or algorithmic information of is the length of the shortest halting program computing x: