{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T06:22:27Z","timestamp":1772432547953,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(83)90139-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"71-93","source":"Crossref","is-referenced-by-count":44,"title":["On the relation between descriptional complexity and algorithmic probability"],"prefix":"10.1016","volume":"22","author":[{"given":"P\u00e9ter","family":"G\u00e1cs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90139-1_BIB1","first-page":"1251","article-title":"The complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set","volume":"9","author":"Barzdin'","year":"1968","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(83)90139-1_BIB2","series-title":"Research Report","article-title":"On random and hard-to-describe numbers","author":"Bennett","year":"1979"},{"key":"10.1016\/0304-3975(83)90139-1_BIB3","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":"J. ACM"},{"key":"10.1016\/0304-3975(83)90139-1_BIB4","first-page":"1477","article-title":"On the symmetry of algorithmic information","volume":"15","author":"G\u00e1cs","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(83)90139-1_BIB5","doi-asserted-by":"crossref","DOI":"10.1002\/malq.19800262502","article-title":"Exact expressions for some randomness tests","volume":"26","author":"G\u00e1cs","year":"1980","journal-title":"Z. Math. Logik. Grundl. Math."},{"issue":"5","key":"10.1016\/0304-3975(83)90139-1_BIB6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1038\/scientificamerican1179-20","article-title":"The random number omega bids fair to hold mysteries of the universe","volume":"241","author":"Gardner","year":"1979","journal-title":"Scientific American"},{"key":"10.1016\/0304-3975(83)90139-1_BIB7","series-title":"Measure Theory","author":"Halmos","year":"1950"},{"key":"10.1016\/0304-3975(83)90139-1_BIB8","first-page":"4","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(83)90139-1_BIB9","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","article-title":"Logical basis for Information Theory and Probability Theory","volume":"14","author":"Kolmogorov","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/0304-3975(83)90139-1_BIB10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms","volume":"25","author":"Levin","year":"1970","journal-title":"Russian Math. Surveys"},{"issue":"5","key":"10.1016\/0304-3975(83)90139-1_BIB11","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"10.1016\/0304-3975(83)90139-1_BIB12","first-page":"206","article-title":"Laws of information conservation (nongrowth) and aspects of the foundations of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(83)90139-1_BIB13","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","article-title":"A variant of the Kolmogorov concept of complexity","volume":"15","author":"Loveland","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(83)90139-1_BIB14","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(83)90139-1_BIB15","first-page":"75","article-title":"On a simple source for non-computable functions","volume":"XII","author":"Rado","year":"1962"},{"key":"10.1016\/0304-3975(83)90139-1_BIB16","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. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90139-1_BIB17","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\/0304-3975(83)90139-1_BIB18","unstructured":"R. Solovay, Unpublished manuscript (1976)."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901391?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901391?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:27:36Z","timestamp":1555126056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583901391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583901391"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90139-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}