Discuss the difficulty of defining randomness in a finite string. Explain the concept of Kolmogorov Complexity, where a string is random if it cannot be compressed by an algorithm shorter than the string itself. Analyze the implications of this definition, including the fact that Kolmogorov complexity is uncomputable, and how this challenges our understanding of chaos and order.