{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:46Z","timestamp":1725558946758},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252610"},{"type":"electronic","value":"9783540318347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31834-7_9","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:23:40Z","timestamp":1278095020000},"page":"116-127","source":"Crossref","is-referenced-by-count":3,"title":["Real Recursive Functions and Real Extensions of Recursive Functions"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Hainry","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Ordinary Differential Equations","author":"V.I. Arnold","year":"1978","unstructured":"Arnold, V.I.: Ordinary Differential Equations. MIT Press, Cambridge (1978)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Asarin, E., Bouajjani, A.: Perturbed Turing machines and hybrid systems. In: Logic in Computer Science, pp. 269\u2013278 (2001)","DOI":"10.1109\/LICS.2001.932503"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1006\/jcss.1998.1601","volume":"57","author":"E. Asarin","year":"1998","unstructured":"Asarin, E., Maler, O.: Achilles and the tortoise climbing up the arithmetical hierarchy. Journal of Computer and System Sciences\u00a057(3), 389\u2013398 (1998)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(98)00096-6","volume":"210","author":"O. Bournez","year":"1999","unstructured":"Bournez, O.: Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy. Theoretical Computer Science\u00a0210(1), 21\u201371 (1999)","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","unstructured":"Bournez, O.: Complexit\u00e9 Algorithmique des Syst\u00e9mes Dynamiques Continus et Hybrides. PhD thesis, Ecole Normale Sup\u00e9rieure de Lyon, Janvier (1999)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-27836-8_25","volume-title":"Automata, Languages and Programming","author":"O. Bournez","year":"2004","unstructured":"Bournez, O., Hainry, E.: An analog characterization of elementary computable functions over the real numbers. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 269\u2013280. Springer, Heidelberg (2004)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(95)00249-9","volume":"162","author":"V. Brattka","year":"1996","unstructured":"Brattka, V.: Recursive characterizations of computable real-value functions and relations. Theoretical Computer Science\u00a0162(1), 45\u201377 (1996)","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-1-4615-0755-0_5","volume-title":"Computability and Models","author":"V. Brattka","year":"2003","unstructured":"Brattka, V.: Computability over topological structures. In: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models, pp. 93\u2013136. Kluwer Academic Publishers, New York (2003)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1006\/jcom.2002.0655","volume":"18","author":"M. Campagnolo","year":"2002","unstructured":"Campagnolo, M., Moore, C., Costa, J.F.: An analog characterization of the Grzegorczyk hierarchy. Journal of Complexity\u00a018(4), 977\u20131000 (2002)","journal-title":"Journal of Complexity"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Campagnolo, M.L.: Computational complexity of real valued recursive functions and analog circuits. PhD thesis, Universidade T\u00e9cnica de Lisboa (2001)","DOI":"10.1007\/3-540-45833-6_1"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1014019225365","volume":"41","author":"G. Etesi","year":"2002","unstructured":"Etesi, G., N\u00e9meti, I.: Non-Turing computations via Malament-Hogarth spacetimes. International Journal Theoretical Physics\u00a041, 341\u2013370 (2002)","journal-title":"International Journal Theoretical Physics"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/S0885-064X(03)00034-7","volume":"19","author":"D. Gra\u00e7a","year":"2003","unstructured":"Gra\u00e7a, D., Costa, J.F.: Analog computers and recursive functions over the reals. Journal of Complexity\u00a019, 644\u2013664 (2003)","journal-title":"Journal of Complexity"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","volume":"42","author":"A. Grzegorczyk","year":"1955","unstructured":"Grzegorczyk, A.: Computable functionals. Fundamenta Mathematicae\u00a042, 168\u2013202 (1955)","journal-title":"Fundamenta Mathematicae"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Hybrid Systems: Computation and Control","author":"T. Henzinger","year":"1999","unstructured":"Henzinger, T., Raskin, J.-F.: Robust undecidability of timed and hybrid systems. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol.\u00a01569. Springer, Heidelberg (1999)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00682813","volume":"5","author":"M.L. Hogarth","year":"1992","unstructured":"Hogarth, M.L.: Does general relativity allow an observer to view an eternity in a finite time? Foundations of Physics Letters\u00a05, 173\u2013181 (1992)","journal-title":"Foundations of Physics Letters"},{"key":"9_CR16","first-page":"1","volume":"50","author":"L. Kalm\u00e1r","year":"1943","unstructured":"Kalm\u00e1r, L.: Egyszer\u00fc p\u00e9lda eld\u00f6nthetetlen aritmetikai probl\u00e9m\u00e1ra. Mate\u00e9s fizikai lapok\u00a050, 1\u201323 (1943)","journal-title":"Mate\u00e9s fizikai lapok"},{"key":"9_CR17","first-page":"151","volume":"241","author":"D. Lacombe","year":"1955","unstructured":"Lacombe, D.: Extension de la notion de fonction r\u00e9cursive aux fonctions d\u2019une ou plusieurs variables r\u00e9elles III. Comptes rendus de l\u2019Acad\u00e9mie des Sciences Paris\u00a0241, 151\u2013153 (1955)","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie des Sciences Paris"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1090\/S0002-9939-1987-0870803-1","volume":"99","author":"L. Lipshitz","year":"1987","unstructured":"Lipshitz, L., Rubel, L.A.: A differentially algebraic replacement theorem, and analog computability. Proceedings of the American Mathematical Society\u00a099(2), 367\u2013372 (1987)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(95)00248-0","volume":"162","author":"C. Moore","year":"1996","unstructured":"Moore, C.: Recursion theory on the reals and continuous-time computation. Theoretical Computer Science\u00a0162(1), 23\u201344 (1996)","journal-title":"Theoretical Computer Science"},{"key":"9_CR20","first-page":"83","volume":"16","author":"J. Mycka","year":"2003","unstructured":"Mycka, J.: Infinite limits and R-recursive functions. Acta Cybernetica\u00a016, 83\u201391 (2003)","journal-title":"Acta Cybernetica"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(02)00744-2","volume":"302","author":"J. Mycka","year":"2003","unstructured":"Mycka, J.: \u03bc-recursion and infinite limits. Theoretical Computer Science\u00a0302, 123\u2013133 (2003)","journal-title":"Theoretical Computer Science"},{"key":"9_CR22","volume-title":"Classical recursion theory II","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical recursion theory II. North-Holland, Amsterdam (1999)"},{"key":"9_CR23","unstructured":"Ord, T.: Hypercomputation: computing more than the Turing machine. Technical report, University of Melbourne, (September 2002), See, http:\/\/www.arxiv.org\/abs\/math.lo\/0209332"},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-1-4613-3394-4_11","volume-title":"Advances in Algorithms, Languages, and Complexity","author":"P. Orponen","year":"1997","unstructured":"Orponen, P.: A survey of continuous-time computation theory. In: Du, D.-Z., Ko, K.-I. (eds.) Advances in Algorithms, Languages, and Complexity, pp. 209\u2013224. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1974-0347575-8","volume":"199","author":"M.B. Pour-El","year":"1974","unstructured":"Pour-El, M.B.: Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers). Transactions of the American Mathematical Society\u00a0199, 1\u201328 (1974)","journal-title":"Transactions of the American Mathematical Society"},{"key":"9_CR26","unstructured":"Ramis, E., Deschamp, C., Odoux, J.: Cours de math\u00e9matiques sp\u00e9ciales, tome 3, topologie et \u00e9l\u00e9ments d\u2019analyse. Masson (February 1995)"},{"key":"9_CR27","unstructured":"Rose, H.: Subrecursion: functions and hierarchies. Clarendon Press (1984)"},{"key":"9_CR28","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/sapm1941201337","volume":"20","author":"C.E. Shannon","year":"1941","unstructured":"Shannon, C.E.: Mathematical theory of the differential analyser. Journal of Mathematics and Physics MIT\u00a020, 337\u2013354 (1941)","journal-title":"Journal of Mathematics and Physics MIT"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Siegelmann, H.: Neural networks and analog computation - beyond the Turing limit, Birkauser (1998)","DOI":"10.1007\/978-1-4612-0707-8"},{"key":"9_CR30","first-page":"230","volume":"2","author":"A. Turing","year":"1936","unstructured":"Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society\u00a02, 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"9_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable analysis. Springer, Heidelberg (2000)"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0045082","volume-title":"Computing and Combinatorics","author":"Q. Zhou","year":"1997","unstructured":"Zhou, Q.: Subclasses of computable real valued functions. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol.\u00a01276, pp. 156\u2013165. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31834-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:27:47Z","timestamp":1605760067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31834-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252610","9783540318347"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31834-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}