{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:42:10Z","timestamp":1648989730543},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:00:00Z","timestamp":1183680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00224-007-9026-5","type":"journal-article","created":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T17:29:53Z","timestamp":1183656593000},"page":"603-624","source":"Crossref","is-referenced-by-count":1,"title":["Classification of Computably Approximable Real Numbers"],"prefix":"10.1007","volume":"43","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,6]]},"reference":[{"key":"9026_CR1","volume-title":"Computable Calculus","author":"O. Aberth","year":"2001","unstructured":"Aberth, O.: Computable Calculus. Academic, San Diego (2001)"},{"issue":"4","key":"9026_CR2","doi-asserted-by":"crossref","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. J. Complex. 16(4), 676\u2013690 (2000)","journal-title":"J. Complex."},{"issue":"1\u20132","key":"9026_CR3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0304-3975(98)00285-0","volume":"219","author":"D.S. Bridges","year":"1999","unstructured":"Bridges, D.S.: Constructive mathematics: a foundation for computable analysis. Theor. Comput. Sci. 219(1\u20132), 95\u2013109 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9026_CR4","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 255, 125\u2013149 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9026_CR5","series-title":"Lect. Notes Log.","first-page":"97","volume-title":"The Notre Dame Lectures","author":"R.G. Downey","year":"2005","unstructured":"Downey, R.G.: Some computability-theoretic aspects of reals and randomness. In: The Notre Dame Lectures. Lect. Notes Log., vol. 18, pp. 97\u2013147. Assoc. Symb. Logic, Urbana (2005)"},{"issue":"1","key":"9026_CR6","doi-asserted-by":"crossref","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. Algebra i Logika 7(1), 47\u201373 (1968); 7(4), 15\u201347 (1968); 9, 34\u201351 (1970) (Russian)","journal-title":"Algebra i Logika"},{"key":"9026_CR7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1073\/pnas.43.2.236","volume":"43","author":"R.M. Friedberg","year":"1957","unstructured":"Friedberg, R.M.: Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post\u2019s problem, 1944). Proc. Nat. Acad. Sci. U.S.A. 43, 236\u2013238 (1957)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"9026_CR8","first-page":"46","volume":"4","author":"A. Grzegorczyk","year":"1953","unstructured":"Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Mat. 4, 46 (1953)","journal-title":"Rozprawy Mat."},{"key":"9026_CR9","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K.-I. Ko","year":"1991","unstructured":"Ko, K.-I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1991)"},{"issue":"2","key":"9026_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.2307\/421040","volume":"1","author":"S. Lempp","year":"1995","unstructured":"Lempp, S., Lerman, M.: A general framework for priority arguments. Bull. Symb. Log. 1(2), 189\u2013201 (1995)","journal-title":"Bull. Symb. Log."},{"key":"9026_CR11","first-page":"194","volume":"108","author":"A.A. Muchnik","year":"1956","unstructured":"Muchnik, A.A.: On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Akad. Nauk SSSR (N.S.) 108, 194\u2013197 (1956)","journal-title":"Dokl. Akad. Nauk SSSR (N.S.)"},{"issue":"1","key":"9026_CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.2307\/2266321","volume":"18","author":"J. Myhill","year":"1953","unstructured":"Myhill, J.: Criteria of constructibility for real numbers. J. Symb. Log. 18(1), 7\u201310 (1953)","journal-title":"J. Symb. Log."},{"key":"9026_CR13","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin (1989)"},{"key":"9026_CR14","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1007\/3-540-44679-6_65","volume-title":"Proceedings of COCOON 2001, Guilin, China, August 20\u201323, 2001","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: Proceedings of COCOON 2001, Guilin, China, August 20\u201323, 2001. Lecture Notes in Comput. Sci., vol. 2108, pp. 586\u2013595. Springer, Berlin (2001)"},{"key":"9026_CR15","doi-asserted-by":"crossref","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. Am. Math. Soc. 5, 784\u2013791 (1954)","journal-title":"Proc. Am. Math. Soc."},{"key":"9026_CR16","first-page":"280","volume":"16","author":"R.M. Robinson","year":"1951","unstructured":"Robinson, R.M.: Review of \u201cPeter, R., Rekursive Funktionen\u201d. J. Symb. Log. 16, 280\u2013282 (1951)","journal-title":"J. Symb. Log."},{"key":"9026_CR17","doi-asserted-by":"crossref","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. Pac. J. Math. 31, 215\u2013231 (1969)","journal-title":"Pac. J. Math."},{"key":"9026_CR18","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Springer, Berlin (1987)"},{"issue":"3","key":"9026_CR19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"Specker, E.: Nicht konstruktiv beweisbare S\u00e4tze der Analysis. J. Symb. Log. 14(3), 145\u2013158 (1949)","journal-title":"J. Symb. Log."},{"issue":"2","key":"9026_CR20","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. Proc. Lond. Math. Soc. 42(2), 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"key":"9026_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis, An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis, An Introduction. Springer, Berlin (2000)"},{"issue":"4\/5","key":"9026_CR22","doi-asserted-by":"crossref","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. Math. Log. Q. 50(4\/5), 431\u2013442 (2004)","journal-title":"Math. Log. Q."},{"key":"9026_CR23","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/s00224-004-1159-1","volume":"38","author":"X. Zheng","year":"2005","unstructured":"Zheng, X., Rettinger, R., Gengler, R.: Closure properties of real number classes under CBV functions. Theory Comput. Syst. 38, 701\u2013729 (2005)","journal-title":"Theory Comput. Syst."},{"key":"9026_CR24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2005.09.054","volume":"351","author":"X. Zheng","year":"2006","unstructured":"Zheng, X., Lu, D., Bao, K.: Divergence bounded computable real numbers. Theory Comput. Sci. 351, 27\u201338 (2006)","journal-title":"Theory Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9026-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9026-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9026-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:34Z","timestamp":1558698694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9026-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,6]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9026"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9026-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,6]]}}}