{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:41:42Z","timestamp":1751636502875},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1016\/0020-0255(91)90021-l","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"23-33","source":"Crossref","is-referenced-by-count":26,"title":["An almost machine-independent theory of program-length complexity, sophistication, and induction"],"prefix":"10.1016","volume":"56","author":[{"given":"Moshe","family":"Koppel","sequence":"first","affiliation":[]},{"given":"Henri","family":"Atlan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(91)90021-L_BIB1","series-title":"The Universal Turing Machine: A Half-Century Survey","first-page":"227","article-title":"Logical depth and physical complexity","author":"Bennett","year":"1988"},{"key":"10.1016\/0020-0255(91)90021-L_BIB2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","article-title":"A theory of program size formally identical to information theory","volume":"22","author":"Chaitin","year":"1975","journal-title":"Jour. ACM"},{"key":"10.1016\/0020-0255(91)90021-L_BIB3","series-title":"The Maximum Entropy Formalism","first-page":"479","article-title":"Toward a mathematical definition of \u201clife,\u201d","author":"Chaitin","year":"1979"},{"key":"10.1016\/0020-0255(91)90021-L_BIB4","series-title":"The Impart of Processing Techniques on Communications","article-title":"Kolmogorov complexity, data compressing, and inference","author":"Cover","year":"1985"},{"key":"10.1016\/0020-0255(91)90021-L_BIB5","first-page":"1474","article-title":"On the symmetry of algorithmic information","volume":"15","author":"Gacs","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0020-0255(91)90021-L_BIB6","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogoroff","year":"1965","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0020-0255(91)90021-L_BIB7","series-title":"The Universal Turing Machine: A Half-Century Survey","first-page":"435","article-title":"Structure","author":"Koppel","year":"1988"},{"issue":"5","key":"10.1016\/0020-0255(91)90021-L_BIB8","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"issue":"1","key":"10.1016\/0020-0255(91)90021-L_BIB9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","article-title":"Randomness conservation inequalities: Information and independence in mathematical theories","volume":"6","author":"Levin","year":"1984","journal-title":"Information and Control"},{"key":"10.1016\/0020-0255(91)90021-L_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00534110","article-title":"Complexity of oscillations in infinite binary sequences","volume":"19","author":"Martin-Lof","year":"1971","journal-title":"ZWVG"},{"key":"10.1016\/0020-0255(91)90021-L_BIB11","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comp. Syst. Sci."},{"key":"10.1016\/0020-0255(91)90021-L_BIB12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.2307\/2272862","article-title":"General random sequences and learnable sequences","volume":"42","author":"Schnorr","year":"1977","journal-title":"J. Symb. Logic"},{"key":"10.1016\/0020-0255(91)90021-L_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/0020-0255(91)90021-L_BIB14","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","article-title":"Complexity-based inductive systems","volume":"24","author":"Solomonoff","year":"1978","journal-title":"IEEE Trans. Inf. Theor."},{"key":"10.1016\/0020-0255(91)90021-L_BIB15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russian Math. Surveys"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190021L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190021L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:24:14Z","timestamp":1552915454000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559190021L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["002002559190021L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(91)90021-l","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}