{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T08:16:29Z","timestamp":1770884189127,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01201280","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T07:15:55Z","timestamp":1108710955000},"page":"271-292","source":"Crossref","is-referenced-by-count":54,"title":["Relations between varieties of kolmogorov complexities"],"prefix":"10.1007","volume":"29","author":[{"given":"V. A.","family":"Uspensky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01201280_CR1","unstructured":"C. Calude,Information and Randomness. An Algorithmic Perspective. Springer-Verlag, Auckland, in press."},{"key":"BF01201280_CR2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G. J. Chaitin","year":"1966","unstructured":"G. J. Chaitin, On the length of programs for computing finite binary sequences,J. Assoc. Comput. Mach.,13 (1966), 547\u2013569.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01201280_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","volume":"16","author":"G. J. Chaitin","year":"1969","unstructured":"G. J. Chaitin, On the length of programs for computing finite binary sequences: statistical considerations,J. Assoc. Comput. Mach.,16 (1969), 145\u2013159.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01201280_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G. J. Chaitin","year":"1975","unstructured":"G. J. Chaitin, A theory of program size formally identical to information theory,J. Assoc. Comput. Mach.,22 (1975), 329\u2013340.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01201280_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608858","volume-title":"Algorithmic Information Theory","author":"G. J. Chaitin","year":"1987","unstructured":"G. J. Chaitin,Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987."},{"key":"BF01201280_CR6","doi-asserted-by":"crossref","DOI":"10.1142\/0531","volume-title":"Information, Randomness and Incompleteness. Papers on Algorithmic Information Theory","author":"G. J. Chaitin","year":"1987","unstructured":"G. J. Chaitin,Information, Randomness and Incompleteness. Papers on Algorithmic Information Theory, World Scientific, Singapore, 1987; expanded second edition in 1992."},{"key":"BF01201280_CR7","unstructured":"G.J. Chaitin, Foreword to [1]."},{"key":"BF01201280_CR8","first-page":"1477","volume":"15","author":"P. G\u00e1cs","year":"1974","unstructured":"P. G\u00e1cs, On the symmetry of algorithmic information,Soviet Math. Dokl.,15 (1974), 1477\u20131480. (Translated from the Russian version.)","journal-title":"Soviet Math. Dokl."},{"key":"BF01201280_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(83)90139-1","volume":"22","author":"P. G\u00e1cs","year":"1983","unstructured":"P. G\u00e1cs, On the relation between descriptional complexity and algorithmic probability.Theoret. Comput. Sci.,22 (1983), 71\u201393.","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"BF01201280_CR10","doi-asserted-by":"crossref","first-page":"624","DOI":"10.2307\/2274882","volume":"54","author":"P. G\u00e1cs","year":"1989","unstructured":"P. G\u00e1cs, A review of [5],J. Symbolic Logic,54(2) (1989), 624\u2013627.","journal-title":"J. Symbolic Logic"},{"key":"BF01201280_CR11","unstructured":"P. G\u00e1cs, Personal communication, April, 1993."},{"issue":"1","key":"BF01201280_CR12","first-page":"1","volume":"1","author":"A. N. Kolmogorov","year":"1965","unstructured":"A. N. Kolmogorov, Three approaches to the quantitative definition of information,Problems Inform. Transmission,1(1) (1965), 1\u20137. (Translated from the Russian version.)","journal-title":"Problems Inform. Transmission"},{"key":"BF01201280_CR13","first-page":"1413","volume":"14","author":"L. A. Levin","year":"1973","unstructured":"L. A. Levin, On the notion of arandom sequence,Soviet Math. Dokl.,14 (1973), 1413\u20131416. (Translated from the Russian version.)","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"BF01201280_CR14","first-page":"206","volume":"10","author":"L. A. Levin","year":"1974","unstructured":"L. A. Levin, Laws of information conservation (non-growth) and aspects of the foundation of probability theory,Problems Inform. Transmission,10(3) (1974), 206\u2013210. (Translated from the Russian version.)","journal-title":"Problems Inform. Transmission"},{"key":"BF01201280_CR15","first-page":"522","volume":"17","author":"L. A. Levin","year":"1976","unstructured":"L. A. Levin, Various measures of complexity for finite objects (axiomatic description),Soviet Math. Dokl.,17 (1976), 522\u2013526. (Translated from the Russian version.)","journal-title":"Soviet Math. Dokl."},{"key":"BF01201280_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1993","unstructured":"M. Li and P. Vit\u00e1nyi,An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, 1993."},{"key":"BF01201280_CR17","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(69)90538-5","volume":"15","author":"D. W. Loveland","year":"1969","unstructured":"D. W. Loveland, A variant of the Kolmogorov concept of complexity,Inform. and Control,15 (1969), 602\u2013619.","journal-title":"Inform. and Control"},{"key":"BF01201280_CR18","first-page":"922","volume":"5","author":"A. A. Markov","year":"1964","unstructured":"A. A. Markov, On normal algorithms which compute Boolean functions,Soviet Math. Dokl.,5 (1964), 922\u2013924. (Translated from the Russian version.)","journal-title":"Soviet Math. Dokl."},{"key":"BF01201280_CR19","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C. P. Schnorr","year":"1973","unstructured":"C. P. Schnorr, Process complexity and effective random tests,J. Comput. System Sci.,7 (1973), 376\u2013388.","journal-title":"J. Comput. System Sci."},{"key":"BF01201280_CR20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-94-017-0837-1_12","volume-title":"Basic Problems in Methodology and Linguistics","author":"C. P. Schnorr","year":"1977","unstructured":"C. P. Schnorr, A survey of the theory of random sequences. In R. E. Butts and J. Hintikka (eds.),Basic Problems in Methodology and Linguistics, Reidel, Dordrecht, 1977, pp. 193\u2013210."},{"issue":"3","key":"BF01201280_CR21","first-page":"569","volume":"29","author":"A. Kh. Shen","year":"1984","unstructured":"A. Kh. Shen, Algorithmic variants of the notion of entropy,Soviet Math. Dokl.,29(3) (1984), 569\u2013573. (Translated from the Russian version.)","journal-title":"Soviet Math. Dokl."},{"key":"BF01201280_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"R. Solomonoff. A formal theory of inductive inference, Part I,Inform. and Control,7 (1964), 1\u201322.","journal-title":"Inform. and Control"},{"key":"BF01201280_CR23","volume-title":"Kolmogorov Complexity and Computational Complexity","author":"V. A. Uspensky","year":"1992","unstructured":"V. A. Uspensky, Complexity and entropy: an introduction to the theory of Kolmogorov complexity. In O. Watanabe (ed.),Kolmogorov Complexity and Computational Complexity, Springer-Verlag, New York, 1992."},{"issue":"1","key":"BF01201280_CR24","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1070\/RM1990v045n01ABEH002321","volume":"45","author":"V. A. Uspensky","year":"1990","unstructured":"V. A. Uspensky, A. L. Semenov, and A. Kh. Shen, Can an individual sequence of zeros and ones be random?,Russian Math. Surveys,45(1) (1990), 121\u2013189. (Translated from the Russian version.)","journal-title":"Russian Math. Surveys"},{"key":"BF01201280_CR25","first-page":"14","volume":"16","author":"V. V. V'yugin","year":"1981","unstructured":"V. V. V'yugin. Algorithmic entropy (complexity) of finite objects and its application to defining randomness and amount of information,Semiotika i Informatika,16 (1981), 14\u201343. (English translation:Selecta Mathematica formerly Sovietica, 13(4) (1994), 357\u2013389.)","journal-title":"Semiotika i Informatika"},{"issue":"6","key":"BF01201280_CR26","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A. K. Zvonkin","year":"1970","unstructured":"A. K. Zvonkin and L. A. Levin, The complexity of finite objects and the developments of the concepts of information and randomness by means of the theory of algorithms,Russian Math. Surveys,25(6) (1970), 83\u2013124. (Translated from the Russian version.)","journal-title":"Russian Math. Surveys"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01201280.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01201280\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01201280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:58:32Z","timestamp":1556715512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01201280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01201280"],"URL":"https:\/\/doi.org\/10.1007\/bf01201280","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}