{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:06Z","timestamp":1760202726186},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T00:00:00Z","timestamp":1517961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00224-018-9848-3","type":"journal-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T01:10:39Z","timestamp":1517965839000},"page":"1620-1636","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Effective Hausdorff Dimension in General Metric Spaces"],"prefix":"10.1007","volume":"62","author":[{"given":"Elvira","family":"Mayordomo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"9848_CR1","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/S0022-0000(05)80073-X","volume":"49","author":"J Cai","year":"1994","unstructured":"Cai, J., Hartmanis, J.: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. J. Comput. Syst. Sci. 49, 605\u2013619 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"9848_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00244-5","volume":"310","author":"JJ Dai","year":"2004","unstructured":"Dai, J.J., Lathrop, J.I., Lutz, J.H., Mayordomo, E.: Finite-state dimension. Theor. Comput. Sci. 310, 1\u201333 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9848_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)"},{"key":"9848_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/0470013850","volume-title":"Fractal Geometry: Mathematical Foundations and Applications","author":"K Falconer","year":"2003","unstructured":"Falconer, K.: Fractal Geometry: Mathematical Foundations and Applications. Wiley, New York (2003)"},{"key":"9848_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2005.03.054","volume":"341","author":"P G\u00e1cs","year":"2005","unstructured":"G\u00e1cs, P.: Uniform test of algorithmic randomness over a general space. Theor. Comput. Sci. 341, 91\u2013137 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9848_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01457179","volume":"79","author":"F Hausdorff","year":"1919","unstructured":"Hausdorff, F.: Dimension und \u00e4u\u00dferes Ma\u00df. Math. Ann. 79, 157\u2013179 (1919)","journal-title":"Math. Ann."},{"key":"9848_CR7","first-page":"24","volume":"36","author":"JM Hitchcock","year":"2005","unstructured":"Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: The fractal geometry of complexity classes. SIGACT News Complexity Theory Column 36, 24\u201338 (2005)","journal-title":"SIGACT News Complexity Theory Column"},{"key":"9848_CR8","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.ipl.2013.04.004","volume":"113","author":"JM Hitchcock","year":"2013","unstructured":"Hitchcock, J.M., Mayordomo, E.: Base invariance of feasible dimension. Inf. Process. Lett. 113, 546\u2013551 (2013)","journal-title":"Inf. Process. Lett."},{"key":"9848_CR9","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ic.2008.12.009","volume":"207","author":"M Hoyrup","year":"2009","unstructured":"Hoyrup, M., Rojas, C.: Computability of probability measures and martin-l\u00f6f randomness over metric spaces. Inf. Comput. 207, 830\u2013847 (2009)","journal-title":"Inf. Comput."},{"issue":"5","key":"9848_CR10","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1137\/S0097539701417723","volume":"32","author":"JH Lutz","year":"2003","unstructured":"Lutz, J.H.: Dimension in complexity classes. SIAM J. Comput. 32(5), 1236\u20131259 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9848_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"JH Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Inf. Comput. 187(1), 49\u201379 (2003)","journal-title":"Inf. Comput."},{"key":"9848_CR12","doi-asserted-by":"crossref","unstructured":"Lutz, J.H., Lutz, N.: Algorithmic information, plane Kakeya sets, and conditional dimension. ACM Transactions on Computation Theory. To appear","DOI":"10.1145\/3201783"},{"key":"9848_CR13","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1137\/070684689","volume":"38","author":"JH Lutz","year":"2008","unstructured":"Lutz, J.H., Mayordomo, E.: Dimensions of points in self-similar fractals. SIAM J. Comput. 38, 1080\u20131112 (2008)","journal-title":"SIAM J. Comput."},{"key":"9848_CR14","doi-asserted-by":"crossref","unstructured":"Mayordomo, E.: Effective Fractal Dimension in Algorithmic Information Theory. In: New Computational Paradigms: Changing Conceptions of What is Computable, pp 259\u2013285. Springer (2008)","DOI":"10.1007\/978-0-387-68546-5_12"},{"key":"9848_CR15","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1112\/blms\/bdr003","volume":"43","author":"J Miller","year":"2011","unstructured":"Miller, J., Greenberg, N.: Diagonally non-recursive functions and effective Hausdorff dimension. Bull. London Math. Soc. 43, 636\u2013654 (2011)","journal-title":"Bull. London Math. Soc."},{"key":"9848_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1002\/malq.201200051","volume":"60","author":"K Miyabe","year":"2014","unstructured":"Miyabe, K.: Algorithmic randomness over general spaces. Math. Log. Q. 60, 184\u2013204 (2014)","journal-title":"Math. Log. Q."},{"key":"9848_CR17","unstructured":"Reimann, J.: Computability and Fractal Dimension. Phd thesis University of Heidelberg (2004)"},{"key":"9848_CR18","first-page":"219","volume":"30","author":"YB Ryabko","year":"1984","unstructured":"Ryabko, Y.B.: Coding of combinatorial sources and Hausdorff dimension. Soviets Math. Doklady 30, 219\u2013222 (1984)","journal-title":"Soviets Math. Doklady"},{"key":"9848_CR19","first-page":"170","volume":"22","author":"YB Ryabko","year":"1986","unstructured":"Ryabko, Y.B.: Noiseless coding of combinatorial sources. Probl. Inf. Transm. 22, 170\u2013179 (1986)","journal-title":"Probl. Inf. Transm."},{"key":"9848_CR20","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00224-014-9546-8","volume":"56","author":"SG Simpson","year":"2015","unstructured":"Simpson, S.G.: Symbolic dynamics: entropy = dimension = complexity. Theory Comput. Syst. 56, 527\u2013543 (2015)","journal-title":"Theory Comput. Syst."},{"key":"9848_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1017","volume":"103","author":"L Staiger","year":"1993","unstructured":"Staiger, L.: Kolmogorov complexity and Hausdorff dimension. Inf. Comput. 103, 159\u201394 (1993)","journal-title":"Inf. Comput."},{"key":"9848_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s002240000086","volume":"31","author":"L Staiger","year":"1998","unstructured":"Staiger, L.: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory Comput. Syst. 31, 215\u201329 (1998)","journal-title":"Theory Comput. Syst."},{"key":"9848_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis. An Introduction","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. An Introduction. Springer, Berlin (2000)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-018-9848-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9848-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9848-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T19:08:58Z","timestamp":1549480138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-018-9848-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,7]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9848"],"URL":"https:\/\/doi.org\/10.1007\/s00224-018-9848-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,7]]},"assertion":[{"value":"7 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}