{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T08:06:07Z","timestamp":1780560367936,"version":"3.54.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":5372,"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":[[1998,11]]},"DOI":"10.1016\/s0304-3975(98)00069-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"263-317","source":"Crossref","is-referenced-by-count":67,"title":["Mathematical metaphysics of randomness"],"prefix":"10.1016","volume":"207","author":[{"given":"Andrei A.","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexei L.","family":"Semenov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir A.","family":"Uspensky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00069-3_BIB1","series-title":"Set Theory and the Continuum Hypothesis","author":"Cohen","year":"1966"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/malq.19800262502","article-title":"Exact expressions for some randomness tests","volume":"26","author":"G\u00e1cs","year":"1980","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math."},{"issue":"2\/3","key":"10.1016\/S0304-3975(98)00069-3_BIB3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(86)80004-3","article-title":"Every sequence is reducible to a random one","volume":"70","author":"G\u00e1cs","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.2307\/1969123","article-title":"On the equivalence of infinite product measures","volume":"49","author":"Kakutani","year":"1948","journal-title":"Ann. Math."},{"issue":"4","key":"10.1016\/S0304-3975(98)00069-3_BIB5","first-page":"369","article-title":"On tables of random numbers","volume":"25","author":"Kolmogorov","year":"1963","journal-title":"Sankhy\u0101. The Indian J. Statist. Ser. A"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB6","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","article-title":"Logical basis for information theory and probability theory","volume":"IT-14","author":"Kolmogorov","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/S0304-3975(98)00069-3_BIB7","first-page":"1","article-title":"On the logical foundations of information theory and probability theory","volume":"5","author":"Kolmogorov","year":"1969","journal-title":"Problems of Inform. Transmission"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB8","series-title":"Proc. 1st World Congr. of the Bernoulli Soc.","first-page":"3","article-title":"Algorithms and randomness","volume":"Vol 1","author":"Kolmogorov","year":"1987"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1137\/1132060","article-title":"Algorithms and randomness","volume":"32","author":"Kolmogorov","year":"1987","journal-title":"Theory of Probability and its Applications"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB10","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Doklady"},{"issue":"6","key":"10.1016\/S0304-3975(98)00069-3_BIB11","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":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB12","series-title":"Intuitionism and Proof Theory","first-page":"73","article-title":"On the notion of randomness","author":"Martin-L\u00f6f","year":"1968"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB13","series-title":"Notes on Constructive Mathematics","author":"Martin-L\u00f6f","year":"1970"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB14","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01203155","article-title":"Grundlagen der Wahrscheinlichkeitsrechnung","volume":"5","author":"von Mises","year":"1919","journal-title":"Mathematische Zeitschrift"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB15","series-title":"Wahrscheinlichkeit, Statistik und Wahrheit","author":"von Mises","year":"1928"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB16","series-title":"Probability, Statistics and Truth","author":"von Mises","year":"1957"},{"issue":"1","key":"10.1016\/S0304-3975(98)00069-3_BIB17","first-page":"295","article-title":"The concept of (\u03b1, \u03b2)-stochastici1y in the Kolmogorov sense, and its properties","volume":"28","author":"Shen","year":"1983","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0304-3975(98)00069-3_BIB18","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\/S0304-3975(98)00069-3_BIB19","series-title":"Kolmogorov Complexity and Computational Complexity","first-page":"85","article-title":"Complexity and entropy: an introduction to the theory of Kolmogorov complexity","author":"Uspensky","year":"1992"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB20_1","series-title":"Theory of Algorithms: Main Discoveries and Applications","author":"Uspensky","year":"1987"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB20_2","series-title":"Algorithms: Main Ideas and Applications","article-title":"Theory of Algorithms: Main Discoveries and Applications","author":"Uspensky","year":"1993"},{"issue":"1","key":"10.1016\/S0304-3975(98)00069-3_BIB21","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1070\/RM1990v045n01ABEH002321","article-title":"Can an individual sequence of zeros and ones be random?","volume":"45","author":"Uspensky","year":"1990","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB22","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01201280","article-title":"Relations between varieties of Kolmogorov complexities","volume":"29","author":"Uspensky","year":"1996","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB23","first-page":"14","article-title":"Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information","volume":"16","author":"V'yugin","year":"1981"},{"issue":"4","key":"10.1016\/S0304-3975(98)00069-3_BIB24","first-page":"357","article-title":"Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information","volume":"13","author":"V'yugin","year":"1994","journal-title":"Selecta Mathematica formerly Sovietica"},{"issue":"2","key":"10.1016\/S0304-3975(98)00069-3_BIB25","first-page":"77","article-title":"Nonstochastic objects","volume":"21","author":"V'yugin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB26","first-page":"180","article-title":"Sur la notion de collectif dans le calcul des probabilit\u00e9s","volume":"202","author":"Wald","year":"1936","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB27","first-page":"38","article-title":"Die Widerspruchsfreiheit des Kollektivbegriffes der Wahrscheinlichkeitsreehnung","volume":"8","author":"Wald","year":"1937"},{"key":"10.1016\/S0304-3975(98)00069-3_BIB28","first-page":"79","article-title":"Die widerspruchsfreiheit des kollektivbegriffes","volume":"735","author":"Wald","year":"1938","journal-title":"Actualit\u00e9s Sci. Indust."},{"key":"10.1016\/S0304-3975(98)00069-3_BIB29","series-title":"Kolmogorov Complexity and Computational Complexity","year":"1992"},{"issue":"6","key":"10.1016\/S0304-3975(98)00069-3_BIB30","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":"Zvonkin","year":"1970","journal-title":"Russian Math. Surveys"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000693?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000693?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:49Z","timestamp":1556315929000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0304397598000693"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00069-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}