{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:07Z","timestamp":1725490027035},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_33","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"327-337","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals"],"prefix":"10.1007","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Cooper, B.S.: Degrees of Unsolvability. Ph.D thesis, Leicester University, Leicester, England (1971)","key":"33_CR1"},{"doi-asserted-by":"crossref","unstructured":"Downey, R.G.: Some computability-theoretic aspects of reals and randomness. In: The Notre Dame lectures. Assoc. Symbol. Logic. Lect. Notes Log., vol.\u00a018, pp. 97\u2013147. Urbana, IL (2005)","key":"33_CR2","DOI":"10.1017\/9781316755907.004"},{"unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg, Monograph to be published","key":"33_CR3"},{"unstructured":"Ershov, Y.L.: A certain hierarchy of sets. i, ii, iii. (Russian). Algebra i Logika. 7(1), 47\u201373 (1968), 7(4), 15\u201347 (1968), 9, 34\u201351 (1970)","key":"33_CR4"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E.M. Gold","year":"1965","unstructured":"Gold, E.M.: Limiting recursion. J. Symbolic Logic\u00a030, 28\u201348 (1965)","journal-title":"J. Symbolic Logic"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/2270581","volume":"30","author":"H. Putnam","year":"1965","unstructured":"Putnam, H.: Trial and error predicates and the solution to a problem of Mostowski. J. Symbolic Logic\u00a030, 49\u201357 (1965)","journal-title":"J. Symbolic Logic"},{"issue":"6","key":"33_CR7","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.jco.2006.04.009","volume":"22","author":"R. Rettinger","year":"2006","unstructured":"Rettinger, R., Zheng, X.: A hierarchy of Turing degrees of divergence bounded computable real numbers. J. Complexity\u00a022(6), 818\u2013826 (2006)","journal-title":"J. Complexity"},{"key":"33_CR8","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. Pacific J. Math.\u00a031, 215\u2013231 (1969)","journal-title":"Pacific J. Math."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1995137","volume":"140","author":"R.I. Soare","year":"1969","unstructured":"Soare, R.I.: Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc.\u00a0140, 271\u2013294 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"33_CR10","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, Heidelberg (1987)"},{"key":"33_CR11","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, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Zheng, X.: Classification of the computably approximable real numbers. Theory of Computing Systems (to appear)","key":"33_CR12","DOI":"10.1007\/s00224-007-9026-5"},{"issue":"Suppl. 1","key":"33_CR13","doi-asserted-by":"crossref","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"},{"doi-asserted-by":"crossref","unstructured":"Zheng, X.: Computability Theory of Real Numbers. Habilitation\u2019s thesis, BTU Cottbus, Germany (February 2005)","key":"33_CR14","DOI":"10.1007\/11780342_60"},{"issue":"4\/5","key":"33_CR15","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. Mathematical Logic Quarterly\u00a050(4\/5), 431\u2013442 (2004)","journal-title":"Mathematical Logic Quarterly"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:17:54Z","timestamp":1619518674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}