Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)

IF 0.5 4区 数学 Q4 STATISTICS & PROBABILITY
A. L. Semenov, A. Kh. Shen, N. K. Vereshchagin
{"title":"Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)","authors":"A. L. Semenov, A. Kh. Shen, N. K. Vereshchagin","doi":"10.1137/s0040585x97t991647","DOIUrl":null,"url":null,"abstract":"Theory of Probability &amp;Its Applications, Volume 68, Issue 4, Page 582-606, February 2024. <br/> 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.","PeriodicalId":51193,"journal":{"name":"Theory of Probability and its Applications","volume":"16 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2024-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory of Probability and its Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/s0040585x97t991647","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0

Abstract

Theory of Probability &Its Applications, Volume 68, Issue 4, Page 582-606, February 2024.
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.
科尔莫戈罗夫的最后发现?(柯尔莫哥洛夫与算法统计)
概率论及其应用》(Theory of Probability &Its Applications),第 68 卷第 4 期,第 582-606 页,2024 年 2 月。 20 世纪 60 年代中期,科尔莫戈罗夫和其他学者提出了有限对象描述复杂性的定义,这一定义现已广为人知。此外,科尔莫哥罗夫还指出了一些对有限对象进行更精细分类的方法,如资源约束复杂性(1965)、结构函数(1974)和$(\alpha,\beta)$随机性(1981)的概念。后来发现,这些方法本质上是等价的,因为它们用不同的坐标定义了同一条曲线。在本研究中,我们试图跟踪科尔莫格罗夫的这些观点以及其他作者独立提出的类似观点的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Theory of Probability and its Applications
Theory of Probability and its Applications 数学-统计学与概率论
CiteScore
1.00
自引率
16.70%
发文量
54
审稿时长
6 months
期刊介绍: Theory of Probability and Its Applications (TVP) accepts original articles and communications on the theory of probability, general problems of mathematical statistics, and applications of the theory of probability to natural science and technology. Articles of the latter type will be accepted only if the mathematical methods applied are essentially new.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信