{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:03:38Z","timestamp":1725480218845},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405054"},{"type":"electronic","value":"9783540450665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_23","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:41:13Z","timestamp":1172666473000},"page":"290-300","source":"Crossref","is-referenced-by-count":0,"title":["On the Monotonic Computability of Semi-computable Real Numbers"],"prefix":"10.1007","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[]},{"given":"George","family":"Barmpalias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"4","key":"23_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":"23_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":"23_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 informationtheoretic analysis. Fundamenta Informaticae, 33(2):105\u2013120, 1998.","journal-title":"Fundamenta Informaticae"},{"key":"23_CR4","unstructured":"R.G. Downey. Some computability-theoretical aspects of real andran domness. Preprint, September 2001."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.2307\/2266321","volume":"18","author":"J. Myhill","year":"1953","unstructured":"J. Myhill. Criteria of constructibility for real numbers. The Journal of Symbolic. Logic, 18(1):7\u201310, 1953.","journal-title":"The Journal of Symbolic. Logic"},{"key":"23_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."},{"key":"23_CR7","series-title":"Lect Notes 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":"R. Rettinger, X. Zheng, R. Gengler, and B. von Braunm\u00fchl. Weakly computable real numbers and total computable real functions. In Proceedings of COCOON 2001, Guilin, China, August 20\u201323, 2001, volume 2108 of LNCS, pages 586\u2013595. Springer, 2001."},{"issue":"3","key":"23_CR8","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":"23_CR9","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":"23_CR10","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."},{"issue":"3","key":"23_CR11","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":"23_CR12","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":"23_CR13","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch. Computability, volume 9 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1987."},{"issue":"Suppl. 1","key":"23_CR14","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":"X. Zheng. Recursive approximability of real numbers. Mathematical Logic Quarterly, 48(Suppl. 1):131\u2013156, 2002.","journal-title":"Mathematical Logic Quarterly"}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T07:48:49Z","timestamp":1587368929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}