{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:44Z","timestamp":1759637984450},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T00:00:00Z","timestamp":1237248000000},"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":[[2010,10]]},"DOI":"10.1007\/s00224-009-9203-9","type":"journal-article","created":{"date-parts":[[2009,3,16]],"date-time":"2009-03-16T18:43:49Z","timestamp":1237229029000},"page":"720-736","source":"Crossref","is-referenced-by-count":5,"title":["Limit Complexities Revisited"],"prefix":"10.1007","volume":"47","author":[{"given":"Laurent","family":"Bienvenu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrej","family":"Muchnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolay","family":"Vereshchagin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,3,17]]},"reference":[{"key":"9203_CR1","unstructured":"Kjos-Hanssen, B.: Private communication, May 2008"},{"issue":"5","key":"9203_CR2","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","volume":"IT-14","author":"A.N. Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Logical basis for information theory and probability theory. IEEE Trans. Inf. Theory IT-14(5), 662\u2013664 (1968). (Russian version was published in 1969.)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9203_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Berlin (1997)","edition":"2"},{"issue":"2","key":"9203_CR4","doi-asserted-by":"crossref","first-page":"555","DOI":"10.2178\/jsl\/1082418543","volume":"69","author":"J. Miller","year":"2004","unstructured":"Miller, J.: Every 2-random real is Kolmogorov random. J. Symb. Log. 69(2), 555\u2013584 (2004)","journal-title":"J. Symb. Log."},{"key":"9203_CR5","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/1132072","volume":"32","author":"A.A. Muchnik","year":"1987","unstructured":"Muchnik, A.A.: Lower limits of frequencies in computable sequences and relativized a priori probability. Theory Probab. Appl. 32, 513\u2013514 (1987)","journal-title":"Theory Probab. Appl."},{"issue":"2","key":"9203_CR6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.2178\/jsl\/1120224726","volume":"70","author":"A. Nies","year":"2005","unstructured":"Nies, A., Stephan, F., Terwijn, S.: Randomness, relativization and Turing degrees. J. Symb. Log. 70(2), 515\u2013535 (2005)","journal-title":"J. Symb. Log."},{"key":"9203_CR7","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)"},{"key":"9203_CR8","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, H. Jr.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967)"},{"key":"9203_CR9","unstructured":"Simpson, S.: Private communication, May 2008"},{"issue":"1\u20132","key":"9203_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(01)00031-7","volume":"271","author":"N.K. Vereshchagin","year":"2002","unstructured":"Vereshchagin, N.K.: Kolmogorov complexity conditional to large integers. Theor. Comput. Sci. 271(1\u20132), 59\u201367 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9203_CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 25(6), 83\u2013124 (1970)","journal-title":"Russ. Math. Surv."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9203-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9203-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9203-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:37Z","timestamp":1558698697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9203-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,17]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9203"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9203-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,17]]}}}