2588 search results - page 2 / 518 » Applications of Kolmogorov complexity to computable model th... |
CAE
2007
13 years 7 months ago
2007
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
CJ
1999
13 years 5 months ago
1999
CIE
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
AGI
2008
13 years 6 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
COCO
2000
Springer
13 years 9 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...