{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:21Z","timestamp":1725484281163},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_7","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:37:01Z","timestamp":1179733021000},"page":"47-56","source":"Crossref","is-referenced-by-count":0,"title":["Computable Real Functions of Bounded Variation and Semi-computable Real Numbers"],"prefix":"10.1007","author":[{"given":"Robert","family":"Rettinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burchard","family":"von Braunm\u00fchl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"issue":"4","key":"7_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"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1112\/S0024609399006736","volume":"32","author":"D. Bridges","year":"2000","unstructured":"D. Bridges. A constructive look at functions of bounded variation. Bull. London Math. Soc., 32(3):316\u2013324, 2000.","journal-title":"Bull. London Math. Soc."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00027-5","volume":"217","author":"C. S. Calude","year":"2002","unstructured":"C. S. Calude. A characterization of c.e. random reals. Theoretical Computer Science, 217:3\u201314, 2002.","journal-title":"Theoretical Computer Science"},{"key":"7_CR4","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":"K.-I. Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston, 1991."},{"key":"7_CR5","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":"M. B. Pour-El and J. I. Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989."},{"key":"7_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1007\/3-540-44679-6_65","volume-title":"Computing and Combinatorics","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 J. Wang, editor, Computing and Combinatorics, volume 2108 of Lecture Notes in Computer Science, pages 586\u2013595, Berlin, 2001. Springer. 7th Annual International Conference, COCOON 2001, Guilin, China, August 20\u201323, 2001."},{"key":"7_CR7","volume-title":"Real Analysis","author":"H. L. Royden","year":"1963","unstructured":"H. L. Royden. Real Analysis. The Macmillan Company, New York, 1963."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1995137","volume":"140","author":"R. Soare","year":"1969","unstructured":"R. Soare. Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc., 140:271\u2013294, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"key":"7_CR9","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":"7_CR10","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."},{"key":"7_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"K. Weihrauch. Computable Analysis. Springer, Berlin, 2000."},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","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":"K. Weihrauch and X. Zheng. A finite hierarchy of the recursively enumerable real numbers. In L. Brim, J. Gruska, and J. Zlatu\u0161ka, editors, Mathematical Foundations of Computer Science 1998, volume 1450 of Lecture Notes in Computer Science, pages 798\u2013806, Berlin, 1998. Springer. 23rd International Symposium, MFCS\u201998, Brno, Czech Republic, August, 1998."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44968-X_17","volume-title":"Computing and Combinatorics","author":"X. Zheng","year":"2000","unstructured":"X. Zheng. Closure properties on real numbers under limits and computable operators. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, editors, Computing and Combinatorics, volume 1859 of Lecture Notes in Computer Science, pages 170\u2013179, Berlin, 2000. Springer. 6th Annual Conference, COCOON\u20192000, Sydney, Australia, July 2000, full version to appear in Theor. Comput. Sci."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"X. Zheng. Recursive approximability of real numbers. Mathematical Logic Quarterly, 48, 2002. (to appear).","DOI":"10.1002\/1521-3870(200210)48:1+<131::AID-MALQ131>3.0.CO;2-#"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"X. Zheng, R. Rettinger and B. von Braunm\u00fchl. On the Jordan decomposability for computable functions of bounded variation. Manuscript, 2002.","DOI":"10.1007\/3-540-36494-3_16"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:27:21Z","timestamp":1556418441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}