{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:50:39Z","timestamp":1742968239130,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276538"},{"type":"electronic","value":"9783642276545"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27654-5_3","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T13:46:33Z","timestamp":1329313593000},"page":"31-45","source":"Crossref","is-referenced-by-count":3,"title":["Random Semicomputable Reals Revisited"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bienvenu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Dagstuhl Seminar Proceedings","first-page":"147","volume-title":"Symposium on Theoretical Aspects of Computer Science (STACS 2009)","author":"L. Bienvenu","year":"2009","unstructured":"Bienvenu, L., Downey, R.: Kolmogorov complexity and Solovay functions. In: Symposium on Theoretical Aspects of Computer Science (STACS 2009). Dagstuhl Seminar Proceedings, vol.\u00a009001, pp. 147\u2013158. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany (2009), http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/1810"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/BFb0028594","volume-title":"STACS 98","author":"C. Calude","year":"1998","unstructured":"Calude, C., Hertling, P., Khoussainov, B., Wang, Y.: Recursively Enumerable Reals and Chaitin Omega Numbers. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 596\u2013606. Springer, Heidelberg (1998)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(76)90005-0","volume":"2","author":"G. Chaitin","year":"1976","unstructured":"Chaitin, G.: Information-theoretical characterizations of recursive infinte strings. Theoretical Computer Science\u00a02, 45\u201348 (1976)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-03816-7_34","volume-title":"Mathematical Foundations of Computer Science 2009","author":"R. H\u00f6lzl","year":"2009","unstructured":"H\u00f6lzl, R., Kr\u00e4ling, T., Merkle, W.: Time-Bounded Kolmogorov Complexity and Solovay Functions. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 392\u2013402. Springer, Heidelberg (2009)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"A. Ku\u010dera","year":"2001","unstructured":"Ku\u010dera, A., Slaman, T.: Randomness and recursive enumerability. SIAM Journal on Computing\u00a031, 199\u2013211 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Levin, L.: Forbidden information. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), p. 761 (2002)","DOI":"10.1109\/SFCS.2002.1182001"},{"key":"3_CR7","unstructured":"Shen, A.: Algorithmic Information theory and Kolmogorov complexity. Technical report TR2000-034. Technical report, Uppsala University (2000)"},{"key":"3_CR8","unstructured":"Solovay, R.: Draft of a paper (or series of papers) on Chaitin\u2019s work. Unpublished notes, 215 pages (1975)"}],"container-title":["Lecture Notes in Computer Science","Computation, Physics and Beyond"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27654-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T21:24:43Z","timestamp":1742505883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27654-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276538","9783642276545"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27654-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}