{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:15Z","timestamp":1725575175038},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261797"},{"type":"electronic","value":"9783540322665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494645_51","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T17:37:10Z","timestamp":1295199430000},"page":"418-428","source":"Crossref","is-referenced-by-count":1,"title":["On the Turing Degrees of Divergence Bounded Computable Reals"],"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":"51_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"},{"issue":"4\/5","key":"51_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/malq.200310103","volume":"50","author":"R. Downey","year":"2004","unstructured":"Downey, R., Wu, G., Zheng, X.: Degrees of d.c.e. reals. Mathematical Logic Quartely\u00a050(4\/5), 345\u2013350 (2004)","journal-title":"Mathematical Logic Quartely"},{"key":"51_CR3","unstructured":"Downey, R.G.: Some computability-theoretical aspects of real and randomness (September 2001) (preprint)"},{"key":"51_CR4","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg (200?) (monograph to be published)"},{"key":"51_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45335-0_2","volume-title":"Computability and Complexity in Analysis","author":"A.J. Dunlop","year":"2001","unstructured":"Dunlop, A.J., Pour-El, M.B.: The degree of unsolvability of a real number. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, p. 16. Springer, Heidelberg (2001)"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(98)00098-X","volume":"210","author":"C.-K. Ho","year":"1999","unstructured":"Ho, C.-K.: Relatively recursive reals and real functions. Theoretical Computer Science\u00a0210, 99\u2013120 (1999)","journal-title":"Theoretical Computer Science"},{"key":"51_CR7","unstructured":"Raichev, A.: D.c.e. reals, relative randomness, and real closed fields. In: CCA 2004, August 16-20, 2004, Lutherstadt Wittenberg, Germany (2004)"},{"key":"51_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/3-540-44679-6_65","volume-title":"Computing and Combinatorics","author":"R. Rettinger","year":"2001","unstructured":"Rettinger, R., Zheng, X., Gengler, R., von Braunm\u00fchl, B.: Weakly computable real numbers and total computable real functions. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 586\u2013595. Springer, Heidelberg (2001)"},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.2307\/2267933","volume":"16","author":"R.M. Robinson","year":"1951","unstructured":"Robinson, R.M.: Review of \u201cPeter, R., Rekursive Funktionen\u201d. The Journal of Symbolic Logic\u00a016, 280\u2013282 (1951)","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"51_CR10","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the \u201cEntscheidungsproblem\u201d. Proceedings of the London Mathematical Society\u00a042(2), 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Zheng, X.: Recursive approximability of real numbers. Mathematical Logic Quarterly 48(Suppl. 1), 131\u2013156 (2002)","DOI":"10.1002\/1521-3870(200210)48:1+<131::AID-MALQ131>3.0.CO;2-#"},{"issue":"2","key":"51_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/logcom\/13.2.159","volume":"13","author":"X. Zheng","year":"2003","unstructured":"Zheng, X.: On the Turing degrees of weakly computable real numbers. Journal of Logic and Computation\u00a013(2), 159\u2013172 (2003)","journal-title":"Journal of Logic and Computation"}],"container-title":["Lecture Notes in Computer Science","New Computational Paradigms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494645_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:18Z","timestamp":1605643158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494645_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261797","9783540322665"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11494645_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}