If all "randomness" of the universe rises from a one extremely long bit string which has been created once from the source of true randomness, the bit string could contain unimaginable number of zeros only and it would be still random. For example, Lotto numbers 1,2,3,4,5,6,7 may be completely random.
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.
Kolmogorov complexity is only meaningful for a specific architecture.
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.
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.