{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:53:22Z","timestamp":1794358402641,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540857792","type":"print"},{"value":"9783540857808","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_13","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T01:23:54Z","timestamp":1220923434000},"page":"170-182","source":"Crossref","is-referenced-by-count":0,"title":["Universal Recursively Enumerable Sets of Strings"],"prefix":"10.1007","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"Nies","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ludwig","family":"Staiger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04978-5","volume-title":"Information and Randomness: An Algorithmic Perspective","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S.: Information and Randomness: An Algorithmic Perspective, 2nd edn., Revised and Extended. Springer, Berlin (2002)","edition":"2"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0304-3975(99)00159-0","volume":"255","author":"C.S. Calude","year":"2001","unstructured":"Calude, C.S., Hertling, P.H., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin \u03a9 numbers. Theoretical Computer Science\u00a0255, 125\u2013149 (2001)","journal-title":"Theoretical Computer Science"},{"key":"13_CR3","unstructured":"Calude, C.S., Staiger, L.: On universal computably enumerable prefix codes. Mathematical Structures in Computer Science (accepted)"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery\u00a022, 329\u2013340 (1975)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(76)90005-0","volume":"2","author":"G.J. Chaitin","year":"1976","unstructured":"Chaitin, G.J.: Information-theoretic characterizations of recursive infinite strings. Theoretical Computer Science\u00a02, 45\u201348 (1976)","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1147\/rd.214.0350","volume":"21","author":"G.J. Chaitin","year":"1977","unstructured":"Chaitin, G.J.: Algorithmic information theory. IBM Journal of Research and Development\u00a021, 350\u2013359+496 (1977)","journal-title":"IBM Journal of Research and Development"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jcss.2003.07.004","volume":"68","author":"R. Downey","year":"2004","unstructured":"Downey, R., Hirschfeldt, D., LaForte, G.: Randomness and reducibility. Journal of Computer and System Sciences\u00a068, 96\u2013114 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/11672142_11","volume-title":"STACS 2006","author":"B. Kjos-Hanssen","year":"2006","unstructured":"Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov Complexity and the Recursion Theorem. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 149\u2013161. Springer, Heidelberg (2006)"},{"key":"13_CR9","first-page":"3","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the definition of the concept \u201cquantity of information\u201d. Problemy Peredachi Informacii\u00a01, 3\u201311 (1965)","journal-title":"Problemy Peredachi Informacii"},{"key":"13_CR10","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, Heidelberg (1997)","edition":"2"},{"key":"13_CR11","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":"13_CR12","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09, 602\u2013619 (1966)","journal-title":"Information and Control"},{"key":"13_CR13","unstructured":"Nies, A.: Computability and Randomness. Oxford University Press, Oxford (to appear)"},{"key":"13_CR14","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C.P. Schnorr","year":"1973","unstructured":"Schnorr, C.P.: Process complexity and effective random tests. Journal of Computer and System Sciences\u00a07, 376\u2013388 (1973)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR16","unstructured":"Solovay, R.: Draft of paper on Chaitin\u2019s work Unpublished notes, 215 pages (1975)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T08:33:18Z","timestamp":1675067598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_13","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}