{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T18:41:49Z","timestamp":1774118509580,"version":"3.50.1"},"reference-count":23,"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)00072-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"343-361","source":"Crossref","is-referenced-by-count":34,"title":["Ergodic theorems for individual random sequences"],"prefix":"10.1016","volume":"207","author":[{"given":"V.V.","family":"V'yugin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00072-3_BIB1","series-title":"Ergodic theory and information","author":"Billingsley","year":"1965"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB2","first-page":"656","article-title":"Proof of the ergodic theorem","volume":"17","author":"Birkhoff","year":"1931"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB3","series-title":"Foundations of constructive analysis","author":"Bishop","year":"1967"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB4","first-page":"127","article-title":"Entropy and the complexity of the trajectories of a dynamical system","volume":"44","author":"Brudno","year":"1983","journal-title":"Trans. Mosc. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00072-3_BIB5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/malq.19800262502","article-title":"Exact expressions for some randomness tests","volume":"26","author":"Gacs","year":"1980","journal-title":"Zetsch. f\u00fcr Math. Logik und Grundl. Math."},{"issue":"1","key":"10.1016\/S0304-3975(98)00072-3_BIB6","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\/S0304-3975(98)00072-3_BIB7","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","article-title":"The logical basis for information theory and probability theory","volume":"IT-14","author":"Kolmogorov","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1070\/RM1983v038n04ABEH004203","article-title":"Combinatorial basis of information theory and probability theory","volume":"38","author":"Kolmogorov","year":"1983","journal-title":"Russ. Math. Surveys"},{"key":"10.1016\/S0304-3975(98)00072-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 Probab. Appl."},{"key":"10.1016\/S0304-3975(98)00072-3_BIB10","series-title":"Ergodic Theorems","author":"Krengel","year":"1985"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB11","series-title":"Random Sequences","author":"Lambalgen","year":"1987"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB12","first-page":"1413","article-title":"On the concept of random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0304-3975(98)00072-3_BIB13","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"issue":"6","key":"10.1016\/S0304-3975(98)00072-3_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":"Inform. and Control"},{"issue":"1","key":"10.1016\/S0304-3975(98)00072-3_BIB15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02763171","article-title":"The Shannon-McMillan-Breiman theorem for a class of amenable groups","volume":"44","author":"Ornstein","year":"1983","journal-title":"Israel J. Math."},{"key":"10.1016\/S0304-3975(98)00072-3_BIB16","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB17","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)00072-3_BIB18","series-title":"Basic Problems in Methodology and Linguistics","first-page":"193","article-title":"A survey of the theory of random sequences","author":"Schnorr","year":"1978"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB19","series-title":"Probability","author":"Shiryaev","year":"1984"},{"issue":"1","key":"10.1016\/S0304-3975(98)00072-3_BIB20","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"},{"issue":"3","key":"10.1016\/S0304-3975(98)00072-3_BIB21","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/1132061","article-title":"The law of the iterated logarithm for random Kolmogorov, or chaotic sequences","volume":"32","author":"Vovk","year":"1987","journal-title":"SIAM Theory Probab. Appl."},{"issue":"1","key":"10.1016\/S0304-3975(98)00072-3_BIB22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1111\/j.2517-6161.1993.tb01482.x","article-title":"On the empirical validity of the Bayesian method","volume":"55","author":"Vovk","year":"1993","journal-title":"J. Royal Statist. Soc. B"},{"key":"10.1016\/S0304-3975(98)00072-3_BIB23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the algorithmic concepts of information and randomness","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russ. Math. Surv."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000723?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000723?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T05:52:37Z","timestamp":1733464357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0304397598000723"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00072-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}