• Information Theory and Kolmogorov Complexity. Weird, eh?

    信息理论柯尔莫·戈洛夫复杂性理论真不可思议,不是么?

    youdao

  • In practice, calculating the true Kolmogorov complexity of a system is almost impossible.

    实际上,要正确计算系统Kolmogorov复杂度几乎不可能的。

    youdao

  • The present study is to introduce the Kolmogorov complexity measure analysis to the field of the early fault diagnosis for rotor-bearing system.

    将复杂度分析方法用于转子-轴承系统早期故障诊断中。

    youdao

  • On this measure, an entity’s intelligence would be measured by the Kolmogorov complexity of the most complex tests it can solve—a clear, numerical value.

    这种设计下,可以通过复杂测试Kolmogorov复杂度测量一个实体智商

    youdao

  • We begin with a discussion of research into protein structure comparison, and highlight the utility of Kolmogorov complexity as a measure of structural similarity.

    我们以对蛋白质结构比较研究讨论开始强调柯氏复杂性作为结构相似性的一个测量效用

    youdao

  • Other researchers are experimenting with a measure called Kolmogorov Complexity, the minimum number of bits a character string can be compressed into without losing information.

    其他研究人员在对Kolmogorov复杂度措施试验,即在丢失信息的情况下一个字符串压缩最小位数

    youdao

  • The Kolmogorov complexity of a computer's output is the shortest possible program (measured in the binary digits that lie at the bottom of all computer code) that could produce that output.

    计算机输出Kolmogorov复杂度产生输出可能最短程序(基于计算机代码二进制位数)。

    youdao

  • 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 ChaitinA.N.Kolmogorov他们关于复杂性形式系统局限性开创性工作中,迫使我们仔细地考虑最后一个说法

    youdao

  • 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)。

    youdao

  • 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)。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定