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.
这个不受欢迎的结果促使 Chaitin和Kolmogorov 提出需要一个新的随机性标准，这个标准依赖于集合的内部一致性，而不是它的起源。
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.
数学家Gregory Chaitin和A.N.Kolmogorov在他们关于复杂性和形式系统的局限性的开创性工作中，迫使我们更仔细地考虑最后一个说法。
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.
用算法加工符号序列，使其长度最小化，并允许观察者将其还原，这涉及算法复杂度，或Kolmogorov - Chaitin复杂度(柯氏复杂度或KCC)。
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.
用算法加工符号序列，使其长度最小化，并允许观察者将其还原，这涉及算法复杂度，或Kolmogorov - Chaitin复杂度(柯氏复杂度或KCC)。
应用推荐