I don&#x27;t think your claims are correct.<p>If you read a formal definition of Chaitin-Kolmogorov, you can find that the concept are essentially normalized by recursive function theory. By using the Church-Turing thesis, you can see that any program in any language can be simulated up to a constant length-multiple by an abstract Turing machine (speed isn&#x27;t considered in these definitions so architecture doesn&#x27;t matter much). Chaintin-Kolmogorov basically considers the log of the length of programs and then thus takes it&#x27;s values as being plus or minus a constant for a given measure.