[mag487]

I haven't really studied algorithmic information theory, but I'd assume that Kolmogorov complexity isn't defined for uncomputable/undefinable numbers. Or maybe it's defined as "infinite," but either way, my guess is that such numbers are simply ignored. (Interestingly, the function which takes a computable number and outputs its Kolmogorov complexity is itself uncomputable!)

[nawitus]

The article at least implies that the Kolmogorov complexity of uncomputable irrational numbers is larger than computable irrational numbers.