Define Kolmogorov complexity for a given text string. Discuss the theoretical assertion that the complexity of a string is the length of the shortest possible program that produces that string. Explain why Kolmogorov complexity is uncomputable.