Anyway, I suggest you reread the end of that paragraph:
“A counting argument is used to show that, for any universal computer, there is at least one algorithmically random string of each length. Whether any particular string is random, however, depends on the specific universal computer that is chosen.”
Kolmogorov complexity is really referring to the fact you can’t have lossless compression of arbitrary bit strings. You can’t encode every possible N+1 bit string using an N bit string. The computer chosen can make an arbitrary 1:1 mapping for any input though. So, it’s got nothing to do with randomness in the context of coin flipping as the mapping is predefined.
Just remember, you’re choosing the computer and at that point any input can be mapped to any output. But, after that point limits show up.
Kolmogorov complexity works only if we have a big sample of random numbers, but we do not know if we have such in this universe or not.
Without access to the architecture of the machine the universe runs on you can’t tell if the initial random string would be one bit or nigh infinite bits.
The citation for that paragraph is a peer-reviewed journal article covering Kolmogorov complexity and randomness. It’s actually a really good article, by someone pretty famous named Per Martin-Löf. Which is all great, except that paper is from 1966, and in 2019 a more studied concept is something called “Martin-Löf randomness” :)
That’s not a definition of unbiased randomness. A true unbiased random number could be all 0’s. Nothing about an unbiased random number demonstrates it’s random, otherwise whatever that distinction is would be a bias in it’s generation.
Kolmogorov complexity is it’s own thing, and sequences that seem very complex can have extremely low complexity. Such as long sequences of hashes of hashes.