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.

In their groundbreaking 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.

Symbolic sequences can be characterized by the length of the minimal algorithm that allows the observer to reconstitute them, referred to as algorithmic complexity or Kolmogorov-Chaitin complexity.