{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:34Z","timestamp":1725493654832},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_12","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"102-111","source":"Crossref","is-referenced-by-count":2,"title":["On the Divergence Bounded Computable Real Numbers"],"prefix":"10.1007","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1006\/jcom.2000.0561","volume":"16","author":"K. Ambos-Spies","year":"2000","unstructured":"K. Ambos-Spies, K. Weihrauch, and X. Zheng. Weakly computable real numbers. Journal of Complexity, 16(4):676\u2013690, 2000.","journal-title":"Journal of Complexity"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00027-5","volume":"271","author":"C. S. Calude","year":"2002","unstructured":"C. S. Calude. A characterization of c.e. random reals. Theoretical Computer Science, 271:3\u201314, 2002.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/FI-1998-33201","volume":"33","author":"C. S. Calude","year":"1998","unstructured":"C. S. Calude and P. Hertling. Computable approximations of reals: An information-theoretic analysis. Fundamenta Informaticae, 33(2):105\u2013120, 1998.","journal-title":"Fundamenta Informaticae"},{"key":"12_CR4","unstructured":"R. G. Downey. Some computability-theoretical aspects of real and randomness. Preprint, September 2001."},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","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":"A. J. Dunlop and M. B. Pour-El. The degree of unsolvability of a real number. In J. Blanck, V. Brattka, and P. Hertling, editors, Computability and Complexity in Analysis, volume 2064 of LNCS, pages 16\u201329, Berlin, 2001. Springer. CCA 2000, Swansea, UK, September 2000."},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/3-540-44683-4_55","volume-title":"Proceedings of MFCS\u201901, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, Czech Republic, August 27\u201331, 2001","author":"R. Rettinger","year":"2001","unstructured":"R. Rettinger and X. Zheng. Hierarchy of monotonically computable real numbers. In Proceedings of MFCS\u201901, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, Czech Republic, August 27\u201331, 2001, volume 2136 of LNCS, pages 633\u2013644. Springer, 2001."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/1521-3870(200204)48:3<459::AID-MALQ459>3.0.CO;2-9","volume":"48","author":"R. Rettinger","year":"2002","unstructured":"R. Rettinger, X. Zheng, R. Gengler, and B. von Braunm\u00fchl. Monotonically computable real numbers. Math. Log. Quart., 48(3):459\u2013479, 2002.","journal-title":"Math. Log. Quart."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.2307\/2267933","volume":"16","author":"R. M. Robinson","year":"1951","unstructured":"R. M. Robinson. Review of \u201cPeter, R., Rekursive Funktionen\u201d. The Journal of Symbolic Logic, 16:280\u2013282, 1951.","journal-title":"The Journal of Symbolic Logic"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","volume":"31","author":"R. Soare","year":"1969","unstructured":"R. Soare. Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math., 31:215\u2013231, 1969.","journal-title":"Pacific J. Math."},{"key":"12_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":"R. I. Soare. Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987."},{"key":"12_CR11","first-page":"215","volume-title":"Draft of a paper (or a series of papers) on chaitin\u2019s work.... manuscript","author":"R. M. Solovay","year":"1975","unstructured":"R. M. Solovay. 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":"12_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"E. Specker. Nicht konstruktiv beweisbare S\u00e4tze der Analysis. The Journal of Symbolic Logic, 14(3):145\u2013158, 1949.","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"12_CR13","first-page":"230","volume":"42","author":"A. M. Turing","year":"1936","unstructured":"A. M. Turing. On computable numbers, with an application to the \u201cEntscheidungsproblem\u201d. Proceedings of the London Mathematical Society, 42(2):230\u2013265, 1936.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"X. Zheng. On the Turing degrees of weakly computable real numbers. Journal of Logic and Computation, 13, 2003. (to appear).","DOI":"10.1093\/logcom\/13.2.159"},{"key":"12_CR15","unstructured":"X. Zheng, R. Rettinger, and R. Gengler. Weak computability and representation of real numbers. Computer Science Reports 02\/03, BTU Cottbus, 2003."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T17:10:47Z","timestamp":1588007447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}