{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:33:54Z","timestamp":1745469234656,"version":"3.40.4"},"reference-count":10,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2013,1,1]]},"DOI":"10.1215\/00294527-1731416","type":"journal-article","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T14:15:27Z","timestamp":1355494527000},"source":"Crossref","is-referenced-by-count":0,"title":["Compressibility and Kolmogorov Complexity"],"prefix":"10.1215","volume":"54","author":[{"given":"Stephen","family":"Binns","sequence":"first","affiliation":[]},{"given":"Marie","family":"Nicholson","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"doi-asserted-by":"publisher","unstructured":"[1] Athreya, K., J. M. Hitchcock, J. H. Lutz, and E. Mayordomo, \u201cEffective strong dimension in algorithmic information and computational complexity,\u201d <i>SIAM Journal on Computing<\/i>, vol. 37 (2007), pp. 671\u2013705. DOI <a href=\"10.1137\/S0097539703446912\">10.1137\/S0097539703446912<\/a>.","key":"1","DOI":"10.1137\/S0097539703446912"},{"doi-asserted-by":"publisher","unstructured":"[2] Binns, S. \u201cRelative Kolmogorov complexity and geometry,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 76 (2011), pp. 1211\u201339.","key":"2","DOI":"10.2178\/jsl\/1318338846"},{"doi-asserted-by":"publisher","unstructured":"[3] Downey, R. G., and N. Greenberg, \u201cTuring degrees of reals of positive effective packing dimension,\u201d <i>Information Processing Letters<\/i>, vol. 108 (2008), pp. 298\u2013303.","key":"3","DOI":"10.1016\/j.ipl.2008.05.028"},{"doi-asserted-by":"crossref","unstructured":"[4] Downey, R. G., and D. R. Hirschfeldt. <i>Algorithmic Randomness and Complexity<\/i>. Springer, New York, 2010.","key":"4","DOI":"10.1007\/978-0-387-68441-3"},{"doi-asserted-by":"publisher","unstructured":"[5] Downey, R. G., D. R. Hirschfeldt, and G. LaForte \u201cRandomness and reducibility,\u201d <i>Journal of Computer and System Sciences<\/i>, vol. 68 (2004), pp. 96\u2013114.","key":"5","DOI":"10.1016\/j.jcss.2003.07.004"},{"doi-asserted-by":"crossref","unstructured":"[6] Lutz, J. H., \u201cDimension in complexity classes,\u201d pp. 158\u201369 in <i>Proceeedings of the Fifteenth Annual IEEE Conference on Computational Complexity (Florence, 2000)<\/i>, IEEE Computer Society, Los Alamos, 2000.","key":"6","DOI":"10.1109\/CCC.2000.856747"},{"doi-asserted-by":"publisher","unstructured":"[7] Mayordomo, E., \u201cA Kolmogorov complexity characterization of constructive Hausdorff dimension,\u201d <i>Information Processing Letters<\/i>, vol. 84 (2002), pp. 1\u20133.","key":"7","DOI":"10.1016\/S0020-0190(02)00343-5"},{"doi-asserted-by":"crossref","unstructured":"[8] Nies, A., <i>Computability and Randomness<\/i>, vol. 51 of <i>Oxford Logic Guides<\/i>, Oxford University Press, Oxford, 2009.","key":"8","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"unstructured":"[9] Reimann, J., <i>Computability and Fractal dimension<\/i>, Ph.D. thesis, Ruprecht-Karls-Universit\u00e4t, Heidelberg, 2004.","key":"9"},{"doi-asserted-by":"publisher","unstructured":"[10] Tricot, C., \u201cTwo definitions of fractional dimension,\u201d <i>Mathematical Proceedings of the Cambridge Philosophical Society<\/i>, vol. 91 (1982), pp. 57\u201374.","key":"10","DOI":"10.1017\/S0305004100059119"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1731416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T18:20:05Z","timestamp":1745432405000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-54\/issue-1\/Compressibility-and-Kolmogorov-Complexity\/10.1215\/00294527-1731416.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,1]]},"references-count":10,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1731416","relation":{},"ISSN":["0029-4527"],"issn-type":[{"type":"print","value":"0029-4527"}],"subject":[],"published":{"date-parts":[[2013,1,1]]}}}