{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:25:35Z","timestamp":1773800735842,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280613","type":"print"},{"value":"9783540318064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_37","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"359-368","source":"Crossref","is-referenced-by-count":5,"title":["Solovay Reducibility on D-c.e Real Numbers"],"prefix":"10.1007","author":[{"given":"Robert","family":"Rettinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"37_CR1","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1006\/jcom.2000.0561","volume":"16","author":"K. Ambos-Spies","year":"2000","unstructured":"Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. Journal of Complexity\u00a016(4), 676\u2013690 (2000)","journal-title":"Journal of Complexity"},{"key":"37_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":"37_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G. Chaitin","year":"1975","unstructured":"Chaitin, G.: A theory of program size formally identical to information theory. J. of ACM\u00a022, 329\u2013340 (1975)","journal-title":"J. of ACM"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-28629-5_3","volume-title":"Mathematical Foundations of Computer Science 2004","author":"R.G. Downey","year":"2004","unstructured":"Downey, R.G.: Some recent progress in algorithmic randomness. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 42\u201383. Springer, Heidelberg (2004)"},{"key":"37_CR5","volume-title":"Algorithmic Randomness and Complexity","author":"R.G. Downey","year":"2000","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg (2000) (monograph to be published)"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-44683-4_28","volume-title":"Mathematical Foundations of Computer Science 2001","author":"R.G. Downey","year":"2001","unstructured":"Downey, R.G., Hirschfeldt, D.R., LaForte, G.: Randomness and reducibility. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 316\u2013327. Springer, Heidelberg (2001)"},{"issue":"4","key":"37_CR7","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1137\/S0097539700376937","volume":"31","author":"R.G. Downey","year":"2002","unstructured":"Downey, R.G., Hirschfeldt, D.R., Nies, A.: Randomness, computability, and density. SIAM J. Comput.\u00a031(4), 1169\u20131183 (2002) (electronic)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"A. Ku\u00e7era","year":"2001","unstructured":"Ku\u00e7era, A., Slaman, T.A.: Randomness and recursive enumerability. SIAM J. Comput.\u00a031(1), 199\u2013211 (2001)","journal-title":"SIAM J. Comput."},{"key":"37_CR9","first-page":"548","volume":"212","author":"L.A. Levin","year":"1973","unstructured":"Levin, L.A.: The concept of a random sequence. Dokl. Akad. Nauk SSSR\u00a0212, 548\u2013550 (1973); English translation: Soviet Math. Dokl. 212, 1413\u20131416 (1974)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"37_CR10","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":"37_CR11","volume-title":"CCA 2004","author":"A. Raichev","year":"2004","unstructured":"Raichev, A.: D.c.e. reals, relative randomness, and real closed fields. In: CCA 2004, August 16-20, Lutherstadt Wittenberg, Germany (2004)"},{"key":"37_CR12","unstructured":"Solovay, R.M.: Draft of a paper (or a series of papers) on chaitin\u2019s work.. IBM Thomas J. Watson Research Center, Yorktown Heights, NY, p. 215 (1975) (manuscript)"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Zheng, X., Rettinger, R., Gengler, R.: Closure properties of real number classes under CBV functions. Theory of Computing Systems (2005) (to appear)","DOI":"10.1007\/s00224-004-1159-1"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-27798-9_39","volume-title":"Computing and Combinatorics","author":"X. Zheng","year":"2004","unstructured":"Zheng, X., Rettinger, R.: On the extensions of solovay-reducibility. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 360\u2013369. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:37:28Z","timestamp":1553139448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11533719_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}