{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:58:01Z","timestamp":1743001081976,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780342_60","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"584-594","source":"Crossref","is-referenced-by-count":3,"title":["A Computability Theory of Real Numbers"],"prefix":"10.1007","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"60_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":"60_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0304-3975(99)00159-0","volume":"255","author":"C. Calude","year":"2001","unstructured":"Calude, C., Hertling, P., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin \u03a9 numbers. Theoretical Computer Science\u00a0255, 125\u2013149 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"4\/5","key":"60_CR3","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 Quarterly\u00a050(4\/5), 345\u2013350 (2004)","journal-title":"Mathematical Logic Quarterly"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G.: Some computability-theoretic aspects of reals and randomness. In: The Notre Dame lectures. Lect. Notes Log, vol.\u00a018, pp. 97\u2013147. Assoc. Symbol. Logic, Urbana (2005)","DOI":"10.1017\/9781316755907.004"},{"key":"60_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. Dunlop","year":"2001","unstructured":"Dunlop, A., Pour-El, M.: The degree of unsolvability of a real number. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, pp. 16\u201329. Springer, Heidelberg (2001)"},{"issue":"1","key":"60_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02218750","volume":"7","author":"Y.L. Ershov","year":"1968","unstructured":"Ershov, Y.L.: A certain hierarchy of sets. i, ii, iii (Russian). Algebra i Logika\u00a07(1), 47\u201373 (1968); 7(4), 15\u201347 (1968); 9, 34\u201351 (1970)","journal-title":"Algebra i Logika"},{"key":"60_CR7","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":"60_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01744572","volume":"16","author":"K.-I. Ko","year":"1983","unstructured":"Ko, K.-I.: On the definitions of some complexity classes of real numbers. Math. Systems Theory\u00a016, 95\u2013109 (1983)","journal-title":"Math. Systems Theory"},{"key":"60_CR9","volume-title":"Progress in Theoretical Computer Science","author":"K.-I. Ko","year":"1991","unstructured":"Ko, K.-I.: Complexity Theory of Real Functions. In: Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1991)"},{"key":"60_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.4064\/fm-49-2-105-118","volume":"49","author":"R. Lehman","year":"1960","unstructured":"Lehman, R.: On primitive recursive real numbers. Fundamenta Mathematicae\u00a049, 105\u2013118 (1960\/1961)","journal-title":"Fundamenta Mathematicae"},{"key":"60_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4064\/fm-44-1-37-51","volume":"44","author":"A. Mostowski","year":"1957","unstructured":"Mostowski, A.: On computable sequences. Fundamenta Mathematicae\u00a044, 37\u201351 (1957)","journal-title":"Fundamenta Mathematicae"},{"issue":"1","key":"60_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.2307\/2266321","volume":"18","author":"J. Myhill","year":"1953","unstructured":"Myhill, J.: Criteria of constructibility for real numbers. The Journal of Symbolic Logic\u00a018(1), 7\u201310 (1953)","journal-title":"The Journal of Symbolic Logic"},{"key":"60_CR13","volume-title":"Rekursive Funktionen","author":"R. P\u00e9ter","year":"1951","unstructured":"P\u00e9ter, R.: Rekursive Funktionen. Akademischer Verlag, Budapest (1951)"},{"key":"60_CR14","unstructured":"Raichev, A.: D.c.e. reals, relative randomness, and real closed fields. In: CCA 2004, August 16-20, 2004. Lutherstadt Wittenberg, Germany (2004)"},{"issue":"5","key":"60_CR15","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/S0885-064X(03)00066-9","volume":"19","author":"R. Rettinger","year":"2003","unstructured":"Rettinger, R., Zheng, X.: On the hierarchy and extension of monotonically computable real numbers. J. Complexity\u00a019(5), 672\u2013691 (2003)","journal-title":"J. Complexity"},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Rettinger, R., Zheng, X.: A hierarchy of on the Turing degrees for divergence bounded computable reals. In: CCA 2005, Kyoto, Japan, August 25-29 (2005)","DOI":"10.1007\/11494645_51"},{"key":"60_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/11533719_37","volume-title":"Computing and Combinatorics","author":"R. Rettinger","year":"2005","unstructured":"Rettinger, R., Zheng, X.: Solovay reducibility on d-c.e. real numbers. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 359\u2013368. Springer, Heidelberg (2005)"},{"key":"60_CR18","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":"60_CR19","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","volume":"5","author":"H.G. Rice","year":"1954","unstructured":"Rice, H.G.: Recursive real numbers. Proc. Amer. Math. Soc.\u00a05, 784\u2013791 (1954)","journal-title":"Proc. Amer. Math. Soc."},{"key":"60_CR20","first-page":"280","volume":"16","author":"R.M. Robinson","year":"1951","unstructured":"Robinson, R.M.: Review of Peter, R., Rekursive Funktionen. The Journal of Symbolic Logic\u00a016, 280\u2013282 (1951)","journal-title":"The Journal of Symbolic Logic"},{"key":"60_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","volume":"31","author":"R.I. Soare","year":"1969","unstructured":"Soare, R.I.: Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math.\u00a031, 215\u2013231 (1969)","journal-title":"Pacific J. Math."},{"key":"60_CR22","unstructured":"Solovay, R.M.: Draft of a paper (or a series of papers) on chaitin\u2019s work. manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, p. 215 (1975)"},{"issue":"3","key":"60_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"Specker, E.: Nicht konstruktiv beweisbare S\u00e4tze der Analysis. The Journal of Symbolic Logic\u00a014(3), 145\u2013158 (1949)","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"60_CR24","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. of the London Mathematical Society\u00a042(2), 230\u2013265 (1936)","journal-title":"Proc. of the London Mathematical Society"},{"key":"60_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/BFb0055831","volume-title":"Mathematical Foundations of Computer Science 1998","author":"K. Weihrauch","year":"1998","unstructured":"Weihrauch, K., Zheng, X.: A finite hierarchy of the recursively enumerable real numbers. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 798\u2013806. Springer, Heidelberg (1998)"},{"key":"60_CR26","unstructured":"Wu, G.: Regular reals. In: Brattka, V., Schr\u00f6der, M., Weihrauch, K., Zhong, N., (eds.) CCA 2003, Cincinnati, USA, Informatik Berichte, FernUniversit\u00e4t Hagen, vol. 302- 8, pp. 363 \u2013 374 (2003)"},{"issue":"suppl. 1","key":"60_CR27","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/1521-3870(200210)48:1+<131::AID-MALQ131>3.0.CO;2-#","volume":"48","author":"X. Zheng","year":"2002","unstructured":"Zheng, X.: Recursive approximability of real numbers. Mathematical Logic Quarterly\u00a048(suppl. 1), 131\u2013156 (2002)","journal-title":"Mathematical Logic Quarterly"},{"key":"60_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45071-8_12","volume-title":"Computing and Combinatorics","author":"X. Zheng","year":"2003","unstructured":"Zheng, X.: On the divergence bounded computable real numbers. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 102\u2013111. Springer, Heidelberg (2003)"},{"issue":"2","key":"60_CR29","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"},{"key":"60_CR30","unstructured":"Zheng, X., Rettinger, R.: A note on the Turing degree of divergence bounded computable real numbers. In: CCA 2004. Lutherstadt Wittenberg, Germany, August 16-20 (2004)"},{"key":"60_CR31","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)"},{"issue":"4\/5","key":"60_CR32","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/malq.200310110","volume":"50","author":"X. Zheng","year":"2004","unstructured":"Zheng, X., Rettinger, R.: Weak computability and representation of reals. Mathematical Logic Quarterly\u00a050(4\/5), 431\u2013442 (2004)","journal-title":"Mathematical Logic Quarterly"},{"issue":"2","key":"60_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/malq.200410016","volume":"51","author":"X. Zheng","year":"2005","unstructured":"Zheng, X., Rettingre, R., Barmpalias, G.: h-monotonically computable real numbers. Mathematical Logic Quarterly\u00a051(2), 1\u201314 (2005)","journal-title":"Mathematical Logic Quarterly"},{"issue":"1","key":"60_CR34","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/1521-3870(200101)47:1<51::AID-MALQ51>3.0.CO;2-W","volume":"47","author":"X. Zheng","year":"2001","unstructured":"Zheng, X., Weihrauch, K.: The arithmetical hierarchy of real numbers. Mathematical Logic Quarterly\u00a047(1), 51\u201365 (2001)","journal-title":"Mathematical Logic Quarterly"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T13:00:49Z","timestamp":1555678849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11780342_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}