Besides noting that there are computable versions of Kolmogorov Complexity (such as MML)
If by MML you mean Minimum message length, then I don't think that's correct. This paper compares Minimum message length with Kolmogorov Complexity but it doesn't seem to make that claim.
How do you use Occam's Razor, what formalizations do you perceive as "proper", or if you're just intuiting the heuristic, guesstimating the complexity, what is the formal principle that your intuition derives from / approximates and how does it differ from e.g. Kolmogorov complexity
My point is that Kolmogorov complexity, Solomonoff induction, etc., are matematical constructions with a formal semantics. Talking about "informal" Kolmogorov complexity is pseudo-mathematics, which is usually an attempt to make your arguments sound more compelling than they are by dressing them in mathematical language.
If there is a disagreement about which hypothesis is simpler, trying to introduce concepts such as ill-defined program lengths that can't be computed, can only obscure the terms of the debate, rather than clarifying them.
From the paper you cited:
"(...) MML usually (but not necessarily) restricts the reference machine to a non-universal form in the interest of computational feasibility. (...) As a result, MML can be, and has routinely been, applied with some confidence to many problems of machine learning (...)"
If there is a disagreement about which hypothesis is simpler, trying to introduce concepts such as ill-defined program lengths that can't be computed, can only obscure the terms of the debate, rather than clarifying them.
There will be such disagreement ...
r/HPMOR readers on heroic responsibility - not the OP, the comments. Holy snorkels this is good.