{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:41Z","timestamp":1725488561634},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443117"},{"type":"electronic","value":"9783540458333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45833-6_1","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:25:53Z","timestamp":1186827953000},"page":"1-14","source":"Crossref","is-referenced-by-count":16,"title":["The Complexity of Real Recursive Functions"],"prefix":"10.1007","author":[{"given":"Manuel Lameiras","family":"Campagnolo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"1_CR1","unstructured":"V. I. Arnold. Equations Diff\u00e9rentielles Ordinaires. Editions Mir, 5 \u00e8me edition, 1996."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1215\/S0012-7094-73-04038-6","volume":"40","author":"A. Babakhanian","year":"1973","unstructured":"A. Babakhanian. Exponentials in differentially algebraic extension fields. Duke Math. J., 40:455\u2013458, 1973.","journal-title":"Duke Math. J."},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(94)00147-B","volume":"138","author":"M.S. Branicky","year":"1995","unstructured":"M.S. Branicky. Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoretical Computer Science, 138(1):67\u2013100, 1995.","journal-title":"Theoretical Computer Science"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completness, recursive functions and universal machines. Bull. Amer. Math. Soc., 21:1\u201346, 1989.","journal-title":"Bull. Amer. Math. Soc."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"M.L. Campagnolo. Computational complexity of real recursive functions and analog circuits. PhD thesis, Instituto Superior T\u00e9cnico, 2001.","DOI":"10.1007\/3-540-45833-6_1"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"P. Clote. Computational models and function algebras. In E.R. Griffor, editor, Handbook of Computability Theory, pages 589\u2013681. Elsevier, 1999.","DOI":"10.1016\/S0049-237X(99)80033-0"},{"key":"1_CR7","unstructured":"M.L. Campagnolo, C. Moore, and J.F. Costa. An analog characterization of the Grzegorczyk hierarchy. To appear in the Journal of Complexity."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"N. J. Cutland. Computability: An Introduction to Recursive Function Theory. Cambridge University Press, 1980.","DOI":"10.1017\/CBO9781139171496"},{"key":"1_CR9","unstructured":"D. Gra\u00e7a. The general purpose analog computer and recursive functions over the reals. Master\u2019s thesis, Instituto Superior T\u00e9cnico, 2002."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","volume":"42","author":"A. Grzegorczyk","year":"1955","unstructured":"A. Grzegorczyk. Computable functionals. Fund. Math., 42:168\u2013202, 1955.","journal-title":"Fund. Math."},{"key":"1_CR11","unstructured":"P. Hartman. Ordinary Differential Equations. Birkhauser, 2nd edition, 1982."},{"key":"1_CR12","volume-title":"Discrete Variable Methods in Ordinary Differential Equations","author":"P. Henrici","year":"1962","unstructured":"P. Henrici. Discrete Variable Methods in Ordinary Differential Equations. Wiley, New York, 1962."},{"key":"1_CR13","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addisson-Wesley, 1979."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(98)00117-0","volume":"210","author":"P. Koiran","year":"1999","unstructured":"P. Koiran and C. Moore. Closed-form analytic maps in one or two dimensions can simulate Turing machines. Theoretical Computer Science, 210:217\u2013223, 1999.","journal-title":"Theoretical Computer Science"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"K.-I. Ko. Complexity Theory of Real Functions. Birkhauser, 1991.","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(95)00248-0","volume":"162","author":"C. Moore","year":"1996","unstructured":"C. Moore. Recursion theory on the reals and continuous-time computation. Theoretical Computer Science, 162:23\u201344, 1996.","journal-title":"Theoretical Computer Science"},{"key":"1_CR17","unstructured":"C. Moore. Finite-dimensional analog computers: flows, maps, and recurrent neural networks. In C.S. Calude, J. Casti, and M.J. Dinneen, editors, Unconventional Models of Computation, DMTCS. Springer-Verlag, 1998."},{"key":"1_CR18","unstructured":"P. Odifreddi. Classical Recursion Theory. Elsevier, 1989."},{"key":"1_CR19","unstructured":"P. Odifreddi. Classical Recursion Theory II. Elsevier, 2000."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2307\/1993719","volume":"106","author":"R.W. Ritchie","year":"1963","unstructured":"R.W. Ritchie. Classes of predictably computable functions. Transactions Amer. Math. Soc., 106:139\u2013173, 1963.","journal-title":"Transactions Amer. Math. Soc."},{"key":"1_CR21","unstructured":"H.E. Rose. Subrecursion: Functions and Hierarchies. Clarendon Press, 1984."},{"key":"1_CR22","unstructured":"J. Traub and A.G. Werschulz. Complexity and Information. Cambridge University Press, 1998."}],"container-title":["Lecture Notes in Computer Science","Unconventional Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45833-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:06:41Z","timestamp":1556752001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45833-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443117","9783540458333"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45833-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}