{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:34:02Z","timestamp":1676961242470},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,20]],"date-time":"2012-04-20T00:00:00Z","timestamp":1334880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00224-012-9400-9","type":"journal-article","created":{"date-parts":[[2012,4,18]],"date-time":"2012-04-18T23:20:29Z","timestamp":1334791229000},"page":"28-47","source":"Crossref","is-referenced-by-count":6,"title":["On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity"],"prefix":"10.1007","volume":"52","author":[{"given":"Martijn","family":"Baartse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Barmpalias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,20]]},"reference":[{"key":"9400_CR1","author":"G. Barmpalias","year":"2010","unstructured":"Barmpalias, G.: Compactness arguments with effectively closed sets for the study of relative randomness. J. Log. Comput. (2010). doi: 10.1093\/logcom\/exq036","journal-title":"J. Log. Comput."},{"issue":"7","key":"9400_CR2","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1016\/j.apal.2009.11.004","volume":"161","author":"G. Barmpalias","year":"2010","unstructured":"Barmpalias, G.: Elementary differences between the degrees of unsolvability and the degrees of compressibility. Ann. Pure Appl. Log. 161(7), 923\u2013934 (2010)","journal-title":"Ann. Pure Appl. Log."},{"issue":"2","key":"9400_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1215\/00294527-2010-012","volume":"51","author":"G. Barmpalias","year":"2010","unstructured":"Barmpalias, G.: Relative randomness and cardinality. Notre Dame J. Form. Log. 51(2), 195\u2013205 (2010)","journal-title":"Notre Dame J. Form. Log."},{"issue":"1","key":"9400_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.apal.2008.06.004","volume":"156","author":"G. Barmpalias","year":"2008","unstructured":"Barmpalias, G., Lewis, A.E.M., Stephan, F.: \u03a0 0 1 classes, LR degrees and Turing degrees. Ann. Pure Appl. Log. 156(1), 21\u201338 (2008)","journal-title":"Ann. Pure Appl. Log."},{"key":"9400_CR5","series-title":"LIPIcs","first-page":"452","volume-title":"STACS","author":"L. Bienvenu","year":"2011","unstructured":"Bienvenu, L., Merkle, W., Nies, A.: Solovay functions and K-triviality. In: Schwentick, T., D\u00fcrr,\u00a0C. (eds.) STACS. LIPIcs, vol. 9, pp. 452\u2013463. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2011)"},{"issue":"52","key":"9400_CR6","doi-asserted-by":"crossref","first-page":"7133","DOI":"10.1016\/j.tcs.2011.09.020","volume":"412","author":"G. Barmpalias","year":"2011","unstructured":"Barmpalias, G., Sterkenburg, T.F.: On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. 412(52), 7133\u20137146 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"41","key":"9400_CR7","doi-asserted-by":"crossref","first-page":"5656","DOI":"10.1016\/j.tcs.2011.06.006","volume":"412","author":"G. Barmpalias","year":"2011","unstructured":"Barmpalias, G., Vlek, C.S.: Kolmogorov complexity of initial segments of sequences and arithmetical definability. Theor. Comput. Sci. 412(41), 5656\u20135667 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9400_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(76)90005-0","volume":"2","author":"G.J. Chaitin","year":"1976","unstructured":"Chaitin, G.J.: Information-theoretical characterizations of recursive infinite strings. Theor. Comput. Sci. 2, 45\u201348 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9400_CR9","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1090\/S0002-9939-05-08086-X","volume":"134","author":"B.F. Csima","year":"2006","unstructured":"Csima, B.F., Montalb\u00e1n, A.: A minimal pair of K-degrees. Proc. Am. Math. Soc. 134(5), 1499\u20131502 (2006) (electronic)","journal-title":"Proc. Am. Math. Soc."},{"key":"9400_CR10","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.ipl.2008.05.028","volume":"108","author":"R. Downey","year":"2008","unstructured":"Downey, R., Greenberg, N.: Turing degrees of reals of positive packing dimension. Inf. Process. Lett. 108, 198\u2013203 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9400_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R. Downey","year":"2010","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)"},{"issue":"2","key":"9400_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1142\/S0219061305000468","volume":"5","author":"R. Downey","year":"2005","unstructured":"Downey, R., Hirschfeldt, D.R., Miller, J.S., Nies, A.: Relativizing Chaitin\u2019s halting probability. J.\u00a0Math. Log. 5(2), 167\u2013192 (2005)","journal-title":"J.\u00a0Math. Log."},{"issue":"3","key":"9400_CR13","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1112\/jlms\/jdm041","volume":"75","author":"D.R. Hirschfeldt","year":"2007","unstructured":"Hirschfeldt, D.R., Nies, A., Stephan, F.: Using random sets as oracles. J. Lond. Math. Soc. 75(3), 610\u2013622 (2007)","journal-title":"J. Lond. Math. Soc."},{"issue":"11","key":"9400_CR14","doi-asserted-by":"crossref","first-page":"3723","DOI":"10.1090\/S0002-9939-07-08871-5","volume":"135","author":"A. Ku\u010dera","year":"2007","unstructured":"Ku\u010dera, A., Slaman, T.: Turing incomparability in Scott sets. Proc. Am. Math. Soc. 135(11), 3723\u20133731 (2007)","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"9400_CR15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1215\/00294527-2009-017","volume":"50","author":"J.S. Miller","year":"2010","unstructured":"Miller, J.S.: The K-degrees, low for K degrees, and weakly low for K sets. Notre Dame J. Form. Log. 50(4), 381\u2013391 (2010)","journal-title":"Notre Dame J. Form. Log."},{"key":"9400_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness","author":"A. Nies","year":"2009","unstructured":"Nies, A.: Computability and Randomness. Oxford University Press, London (2009)"},{"key":"9400_CR17","unstructured":"Reimann, J., Slaman, T.: Measures and their random reals. Submitted (2010)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9400-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9400-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9400-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:23Z","timestamp":1558684463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9400-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,20]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9400"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9400-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,20]]}}}