{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T18:40:07Z","timestamp":1697654407434},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Lang Inf"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10849-005-2255-6","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T15:34:04Z","timestamp":1114616044000},"page":"133-148","source":"Crossref","is-referenced-by-count":3,"title":["Kolmogorov Complexity for Possibly Infinite Computations"],"prefix":"10.1007","volume":"14","author":[{"given":"Ver\u00f3nica","family":"Becher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago","family":"Figueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4471-0717-0_6","volume-title":"Combinatorics, Computability and Logic: Proceedings of the Third Discrete Mathematics and Theoretical Computer Science Conference (DMTCS\u201901)","author":"V. Becher","year":"2001","unstructured":"Becher, V., Daicz, S., and Chaitin, G., 2001, \u201cA highly random number,\u201d pp. 55\u201368 in Combinatorics, Computability and Logic: Proceedings of the Third Discrete Mathematics and Theoretical Computer Science Conference (DMTCS\u201901), C.S. Calude, M.J. Dineen, and S. Sburlan, eds., London: Springer-Verlag."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J., 1975, A theory of program-size formally identical to information theory, Journal of the ACM 22, 329\u2013340.","journal-title":"Journal of the ACM"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0898-1221(76)90016-X","volume":"2","author":"G. Chaitin","year":"1976a","unstructured":"Chaitin, G., 1976a, \u201cAlgorithmic entropy of sets,\u201d Computers & Mathematics with Applications 2, 233\u2013245.","journal-title":"Computers & Mathematics with Applications"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(76)90005-0","volume":"2","author":"G.J. Chaitin","year":"1976b","unstructured":"Chaitin, G.J., 1976b, \u201cInformation-theoretical characterizations of recursive infinite strings,\u201d Theoretical Computer Science 2: 45\u201348.","journal-title":"Theoretical Computer Science"},{"key":"CR5","unstructured":"Ferbus-Zanda, M. and Grigorieff, S., 2004, \u201cKolmogorov complexities Kmax, Kmin\u201d (submitted)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(81)90083-9","volume":"15","author":"H.P. Katseff","year":"1981","unstructured":"Katseff, H.P. and Sipser, M., 1981, \u201cSeveral results in program-size complexity,\u201d Theoretical Computer Science 15, 291\u2013309.","journal-title":"Theoretical Computer Science"},{"key":"CR7","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N., 1965, \u201cThree approaches to the quantitative definition of information,\u201d Problems of Information Transmission 1, 1\u20137.","journal-title":"Problems of Information Transmission"},{"key":"CR8","first-page":"206","volume":"10","author":"L.A. Levin","year":"1974","unstructured":"Levin, L.A., 1974, \u201cLaws of information conservation (non-growth) and aspects of the foundations of probability theory,\u201d Problems of Information Transmission 10, 206\u2013 210.","journal-title":"Problems of Information Transmission"},{"key":"CR9","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. and Vit\u00e1nyi, P. 1997, An Introduction to Kolmogorov Complexity and its Applications (2nd edition), Amsterdam: Springer.","edition":"2nd edition"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Loveland, D.W., 1969, A Variant of the Kolmogorov Concept of Complexity, Information and Control (15), 510\u2013526.","DOI":"10.1016\/S0019-9958(69)90538-5"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"644","DOI":"10.2307\/1970028","volume":"69","author":"J.R.M. Shoenfield","year":"1959","unstructured":"Shoenfield, J.R.M., 1959, \u201cOn degrees of unsovability,\u201d Annals of Mathematics 69, 644\u2013653.","journal-title":"Annals of Mathematics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0049-237X(08)70660-8","volume-title":"Non-Classical Logics, Model Theory, and Computability","author":"R.M. Solovay","year":"1977","unstructured":"Solovay, R.M., 1977, \u201cOn random r.e. sets,\u201d pp. 283\u2013307 in Non-Classical Logics, Model Theory, and Computability, A.I. Arruda, N.C.A. da Costa, and R. Chuaqui, eds., Amsterdam: North-Holland."}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-005-2255-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10849-005-2255-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-005-2255-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:31:00Z","timestamp":1559269860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10849-005-2255-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["2255"],"URL":"https:\/\/doi.org\/10.1007\/s10849-005-2255-6","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}