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.
Second his interest in kolmogorov complexity.
In practice, calculating the true Kolmogorov complexity of a system is almost impossible.
Computability: Sizes of infinity; finite automata and regular languages; Turing machines; the Halting Problem; Busy Beaver numbers; Kolmogorov complexity.
## Tentative list of topics covered * Computability: Sizes of infinity; finite automata and regular languages; Turing machines; the Halting Problem; Busy Beaver numbers; Kolmogorov complexity.
Since description length in the sense of Kolmogorov complexity is uncomputable, practical implementations rely on other notions of independence.
The Minimum Description Length (MDL) principle is solidly based on a provably ideal method of inference using Kolmogorov complexity.
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.
ReprintsDr Hernández-Orallo and Dr Dowe, both computer scientists, propose to make their measurement by borrowing a concept called Kolmogorov complexity from information theory, a branch of computer science.
Born about three decades ago, Kolmogorov complexity theory (KC) led to important discoveries that, in particular, give a new understanding of the fundamental problem: interrelations between classical continuum mathematics and reality (physics, biology, engineering sciences,…).
In order to do this, our test proposal is based on previous works on the measurement of machine intelligence based on Kolmogorov complexity and universal distributions, which were developed in the late 1990s (C-tests and compression-enhanced Turing tests).
