Any string generated from a PRNG clearly has a very short description.  You need the code for the random number generator, the seed, and then the number of times to iterate.  So, it seems that all such strings have low KC complexity.If the above it true, then what is an example of a complex string, in the Kolmogorov-Chatin sense?
What is an example of complex random string, in the Kolmogorov-Chatin sense?
kolmogorov complexity