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)。
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 在他们关于复杂性和形式系统的局限性的开创性工作中，迫使我们更仔细地考虑最后一个说法。
应用推荐