{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T09:14:52Z","timestamp":1772442892187,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2005,8,19]],"date-time":"2005-08-19T00:00:00Z","timestamp":1124409600000},"content-version":"vor","delay-in-days":3914,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80073-x","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"605-619","source":"Crossref","is-referenced-by-count":38,"title":["On hausdorff and topological dimensions of the kolmogorov complexity of the real line"],"prefix":"10.1016","volume":"49","author":[{"given":"Jin-yi","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juris","family":"Hartmanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80073-X_bib1","first-page":"1251","article-title":"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\/S0022-0000(05)80073-X_bib2","first-page":"321","article-title":"On the sum of digits of real numbers represented in the dyadic systems","volume":"34","author":"Besicovitch","year":"1934","journal-title":"Math. Ann."},{"key":"10.1016\/S0022-0000(05)80073-X_bib3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0273-0979-1984-15240-6","article-title":"Complex analytic dynamic systems on the Riemann sphere","volume":"11","author":"Blanchard","year":"1984","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(05)80073-X_bib4","first-page":"146","article-title":"\u00dcber den nat\u00fcrlichen Dimensionsbegriff","volume":"142","author":"Brouwer","year":"1913","journal-title":"J. Math."},{"key":"10.1016\/S0022-0000(05)80073-X_bib5","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. Math."},{"key":"10.1016\/S0022-0000(05)80073-X_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. Math."},{"key":"10.1016\/S0022-0000(05)80073-X_bib7","series-title":"Fractal Geometry\u2014Mathematical Foundations and Applications","author":"Falconer","year":"1990"},{"key":"10.1016\/S0022-0000(05)80073-X_bib8","doi-asserted-by":"crossref","unstructured":"J. Hartmanis, Generalized Kolmogorov complexity and the structure of feasible computation, in \u201cProceedings, 24th Annual Symposium on Foundations of Computer Science, 1983,\u201d pp. 439\u2013445.","DOI":"10.1109\/SFCS.1983.21"},{"key":"10.1016\/S0022-0000(05)80073-X_bib9","series-title":"Dimension Theory","author":"Hurewicz","year":"1974"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80073-X_bib10","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0022-0000(05)80073-X_bib11","first-page":"206","article-title":"Laws of information conservation (non-growth) and aspects of the foundation of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0022-0000(05)80073-X_bib12","doi-asserted-by":"crossref","unstructured":"L. A. Levin, Homogeneous measures and polynomial time invariants, in \u201cProceedings, 29th Annual Symposium on Foundations of Computer Science, 1988,\u201d pp. 36\u201341.","DOI":"10.1109\/SFCS.1988.21919"},{"key":"10.1016\/S0022-0000(05)80073-X_bib13","doi-asserted-by":"crossref","unstructured":"M. Li and P. M. B. Vitanyi, Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903\u20131987, in \u201cProceedings, Structure in Complexity Theory, 3rd Annual Conference, 1988,\u201d pp. 80\u2013101.","DOI":"10.1109\/SCT.1988.5265"},{"key":"10.1016\/S0022-0000(05)80073-X_bib14","series-title":"The Fractal Nature of Geometry","author":"Mandelbrot","year":"1983"},{"key":"10.1016\/S0022-0000(05)80073-X_bib15","unstructured":"A. A. Razborov, personal communication."},{"issue":"No. 3","key":"10.1016\/S0022-0000(05)80073-X_bib16","first-page":"16","article-title":"Noiseless encoding of combinatorial sources, Hausdorff dimension and Kolmogorov complexity","volume":"22","author":"Ryabko","year":"1986","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0022-0000(05)80073-X_bib17","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1090\/S0002-9904-1967-11798-1","article-title":"Differentiable dynamic systems","volume":"73","author":"Smale","year":"1987","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(05)80073-X_bib18_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference, Parts 1, 2","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80073-X_bib18_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference, Parts 1, 2","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80073-X_bib19","first-page":"508","article-title":"Complexity and Entropy, MFCS81","volume":"Vol. 118","author":"Staiger","year":"1981"},{"key":"10.1016\/S0022-0000(05)80073-X_bib20","unstructured":"L. Staiger, Kolmogorov complexity and Hausdorff dimension, manuscript."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000580073X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000580073X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T19:11:23Z","timestamp":1647457883000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000580073X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S002200000580073X"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80073-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}