# GRE Reading Comprehension: JiJing 352-GRE阅读机经352篇 - MU555G45K7M744TKK

Few mathematical constructs seem as conceptually simple as that of randomness. According to the traditional definition, a number is random if it is chosen purely as the result of a probabilistic mechanism such as the roll of a fair die. In their ground breaking work regarding complexity and the limitations of formal systems, mathematicians Gregory Chaitin and A.N. Kolmogorov force us to consider this last claim more closely. Consider two possible outcomes of throwing a fair die three times: first, 1, 6, and 2; second 3, 3, and 3. Now let us construct two three-member sets based on the results. Though the first set – {1,6,2} – intuitively seems more random than the second – {3,3,3}, they are each as likely to occur, and thus according to the accepted definition, must be considered equally random. This unwelcome result prompts Chaitin and Kolmogorov to suggest the need for a new standard of randomness, one that relies on the internal coherence of the set as opposed to its origin.