{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T07:27:06Z","timestamp":1776324426227,"version":"3.50.1"},"reference-count":55,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3582,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0890-5401(03)00187-1","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T01:06:58Z","timestamp":1063328818000},"page":"49-79","source":"Crossref","is-referenced-by-count":123,"title":["The dimensions of individual strings and sequences"],"prefix":"10.1016","volume":"187","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00187-1_BIB1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01448030","article-title":"On the sum of digits of real numbers represented in the dyadic system","volume":"110","author":"Besicovitch","year":"1934","journal-title":"Math. Annal."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB2","series-title":"Ergodic Theory and Information","author":"Billingsley","year":"1965"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB3","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0022-0000(05)80073-X","article-title":"On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line","volume":"49","author":"Cai","year":"1994","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary sequences","volume":"13","author":"Chaitin","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","article-title":"On the length of programs for computing finite binary sequences: statistical considerations","volume":"16","author":"Chaitin","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB6","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0196-8858(87)90010-8","article-title":"Incompleteness theorems for random reals","volume":"8","author":"Chaitin","year":"1987","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB8","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/qmath\/os-20.1.31","article-title":"The fractional dimension of a set defined by decimal properties","volume":"20","author":"Eggleston","year":"1949","journal-title":"Quart. J. Math., Oxford Ser."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB10","series-title":"The Geometry of Fractal Sets","author":"Falconer","year":"1985"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB11","series-title":"Fractal Geometry: Mathematical Foundations and Applications","author":"Falconer","year":"1990"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB12","unstructured":"S.A. Fenner, Gales and supergales are equivalent for defining constructive Hausdorff dimension, Technical Report cs.CC\/0208044, ACM Computing Research Repository, 2002"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S030500410002171X","article-title":"The fractional dimensional theory of continued fractions","volume":"37","author":"Good","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01457179","article-title":"Dimension und \u00e4usseres Mass","volume":"79","author":"Hausdorff","year":"1919","journal-title":"Math. Annal."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0020-0190(02)00454-4","article-title":"Gales suffice for constructive dimension","volume":"86","author":"Hitchcock","year":"2003","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB16","doi-asserted-by":"crossref","unstructured":"J.M. Hitchcock, Correspondence principles for effective dimensions, in: Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, 2002, pp. 561\u2013571","DOI":"10.1007\/3-540-45465-9_48"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB17","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."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB18","first-page":"369","article-title":"On tables of random numbers","volume":"25","author":"Kolmogorov","year":"1963","journal-title":"Sankhy\u0101, Ser. A"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB19","first-page":"1","article-title":"Three approaches to the quantitative definition of \u2018information\u2019","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probl. Inf. Transm."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1070\/RM1983v038n04ABEH004203","article-title":"Combinatorial foundations of information theory and calculus of probabilities","volume":"38","author":"Kolmogorov","year":"1983","journal-title":"Russ. Math. Surveys"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.4064\/fm-37-1-265-285","article-title":"Note on arithmetical models for consistent formulae of the predicate calculus","volume":"37","author":"Kreisel","year":"1950","journal-title":"Fundamen. Math."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB22","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB23","first-page":"206","article-title":"Laws of information conservation (nongrowth) and aspects of the foundation of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Probl. Inf. Transm."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB24","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB25","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1090\/S0002-9947-1966-0207562-2","article-title":"The Kleene hierarchy classification of recursively random sequences","volume":"125","author":"Loveland","year":"1966","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/malq.19660120124","article-title":"A new interpretation of von Mises\u2019 concept of a random sequence","volume":"12","author":"Loveland","year":"1966","journal-title":"Z. Math. Logik"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB27","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1137\/S0097539701417723","article-title":"Dimension in complexity classes","volume":"32","author":"Lutz","year":"2003","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB28","first-page":"902","article-title":"Gales and the constructive dimension of individual sequences","author":"Lutz","year":"2000"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB29","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":"Inf. Contr."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00534110","article-title":"Complexity oscillations in infinite binary sequences","volume":"19","author":"Martin-L\u00f6f","year":"1971","journal-title":"Z. Wahrscheinlichkeit."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(02)00343-5","article-title":"A Kolmogorov complexity characterization of constructive Hausdorff dimension","volume":"84","author":"Mayordomo","year":"2002","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB32","series-title":"Descriptive Set Theory","author":"Moschovakis","year":"1980"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB33","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB34","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB35","first-page":"219","article-title":"Coding of combinatorial sources and Hausdorff dimension","volume":"30","author":"Ryabko","year":"1984","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB36","first-page":"170","article-title":"Noiseless coding of combinatorial sources","volume":"22","author":"Ryabko","year":"1986","journal-title":"Probl. Inf. Transm."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB37","first-page":"186","article-title":"Algorithmic approach to the prediction problem","volume":"29","author":"Ryabko","year":"1993","journal-title":"Probl. Inf. Transm."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB38","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1006\/jcom.1994.1015","article-title":"The complexity and effectiveness of prediction problems","volume":"10","author":"Ryabko","year":"1994","journal-title":"J. Complexity"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB39","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/BF01694181","article-title":"A unified approach to the definition of random sequences","volume":"5","author":"Schnorr","year":"1971","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB40","article-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","volume":"218","author":"Schnorr","year":"1971","journal-title":"Lect. Notes Math."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB41","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. Syst. Sci."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB42","series-title":"Basic Problems in Methodology and Linguistics","first-page":"193","article-title":"A survey of the theory of random sequences","author":"Schnorr","year":"1977"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB43","first-page":"14","article-title":"The frequency approach to the definition of a random sequence","volume":"18","author":"Shen\u2019","year":"1982","journal-title":"Semiotika Informatika"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB44","first-page":"316","article-title":"On relations between different algorithmic definitions of randomness","volume":"38","author":"Shen\u2019","year":"1989","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB45","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB46","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":"Inf. Contr."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB47","unstructured":"R.M. Solovay, 1975, Reported in [7]"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB48","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1017","article-title":"Kolmogorov complexity and Hausdorff dimension","volume":"102","author":"Staiger","year":"1993","journal-title":"Inf. Comput."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB49","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s002240000086","article-title":"A tight upper bound on Kolmogorov complexity and uniformly optimal prediction","volume":"31","author":"Staiger","year":"1998","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB50","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6048-4_34","article-title":"How much can you win when your adversary is handicapped?","author":"Staiger","year":"2000"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB51","unstructured":"S.A. Terwijn, Personal communication, 2000"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB52","doi-asserted-by":"crossref","unstructured":"M. van Lambalgen, Random sequences, Ph.D. Thesis, Department of Mathematics, University of Amsterdam, 1987","DOI":"10.2307\/2274360"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB53","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1017\/S0022481200029728","article-title":"Von Mises\u2019 definition of random sequences reconsidered","volume":"52","author":"van Lambalgen","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0890-5401(03)00187-1_BIB54","first-page":"656","article-title":"On a randomness criterion","volume":"35","author":"Vovk","year":"1987","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0890-5401(03)00187-1_BIB55","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":"Russ. Math. Surveys"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103001871?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103001871?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:29:44Z","timestamp":1551014984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103001871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0890540103001871"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00187-1","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}