KOLMOGOROV'S LAST DISCOVERY? (KOLMOGOROV AND ALGORITHMIC STATISTICS)

被引:0
|
作者
Semenov, A. L. [1 ]
Shen, A. KH. [2 ]
Vereshchagin, N. K. [3 ,4 ]
机构
[1] Lomonosov Moscow State Univ, Moscow, Russia
[2] Univ Montpellier, CNRS, LIRMM, Montpellier, France
[3] Lomonosov Moscow State Univ, Moscow, Russia
[4] Natl Res Univ Higher Sch Econ, Moscow, Russia
关键词
Kolmogorov complexity; algorithmic statistics; resource-bounded complexity; Kolmogorov's structure function; (alpha; beta)-stochasticity; INFORMATION-THEORY; FORMAL THEORY; COMPLEXITY; SOPHISTICATION; LENGTH; FOUNDATIONS; RANDOMNESS; MDL;
D O I
10.1137/S0040585X97T991647
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The definition of descriptional complexity of finite objects suggested by Kolmogorov and other authors in the mid-1960s is now well known. In addition, Kolmogorov pointed out some approaches to a more fine-grained classification of finite objects, such as the resource -bounded complexity (1965), structure function (1974), and the notion of (alpha, beta)-stochasticity (1981). Later it turned out that these approaches are essentially equivalent in that they define the same curve in different coordinates. In this survey, we try to follow the development of these ideas of Kolmogorov as well as similar ideas suggested independently by other authors.
引用
收藏
页码:582 / 606
页数:25
相关论文
共 50 条