So here is my final attempt. Read Chapter 4 "Algorithmic Probability" in the following text:
An Introduction to Kolmogorov Complexity and its Applications
By: Li and Vitanyi
Publisher: Springer-Verlag
This text is the de-facto reference standard for the large body of mathematics loosely associated with the Kolmogorov information theory, but is moderately accessible to someone with a solid grounding in basic mathematics. It is by far the most widely referenced text in academic papers on this topic. This area of mathematics is deeply fundamental to computational processes and software theory of all types.
I have just given you the relevant chapter of THE reference standard for the topic we are discussing, which due to its being a de-facto standard is widely available as such things go (a university library probably has it). If you can show me where my understanding of the mathematics contradicts the text, I will very publicly apologize and admit that you are correct. It is certainly possible that I am wrong, but since I'm extraordinarily competent at that area of mathematics and have used it for years to successfully design very sophisticated systems, I find it improbable.
I believe this is reasonable. Why waste our time arguing about it when we can go straight to the source. Unless, of course, you doubt the validity of that branch of mathematics despite its widespread practical application.