Define Kolmogorov complexity and explain how it provides a formal definition of randomness for a finite string of data. Discuss the paradox that while most strings are incompressible (random), proving that a specific string is random is generally impossible due to the halting problem. Illustrate this theoretical limit with examples.