{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:21:43Z","timestamp":1725891703832},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153303"},{"type":"electronic","value":"9783642153310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15331-0_10","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T09:11:25Z","timestamp":1283850685000},"page":"146-162","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Time Computation in the Context of Recursive Analysis"],"prefix":"10.1007","author":[{"given":"Walid","family":"Gomaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"issue":"9","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/S0005-1098(00)00050-9","volume":"36","author":"V. Blondel","year":"2000","unstructured":"Blondel, V., Tsitsiklis, J.: A Survey of Computational Complexity Results in Systems and Control. Automatica\u00a036(9), 1249\u20131274 (2000)","journal-title":"Automatica"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a Theory of Computation Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines. Bulletin of the American Mathematical Society\u00a021(1), 1\u201346 (1989)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"10_CR4","first-page":"383","volume-title":"New Computational Paradigms. Changing Conceptions of What is Computable","author":"O. Bournez","year":"2008","unstructured":"Bournez, O., Campagnolo, M.: A Survey on Continuous Time Computations. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) New Computational Paradigms. Changing Conceptions of What is Computable, pp. 383\u2013423. Springer, Heidelberg (2008)"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.jco.2006.12.005","volume":"23","author":"O. Bournez","year":"2007","unstructured":"Bournez, O., Campagnolo, M., Gra\u00e7a, D., Hainry, E.: Polynomial Differential Equations Compute All Real Computable Functions on Computable Compact Intervals. Journal of Complexity\u00a023(3), 317\u2013335 (2007)","journal-title":"Journal of Complexity"},{"issue":"4","key":"10_CR6","first-page":"409","volume":"74","author":"O. Bournez","year":"2006","unstructured":"Bournez, O., Hainry, E.: Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundamenta Informaticae\u00a074(4), 409\u2013433 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Campagnolo, M.: Computational Complexity of Real Valued Recursive Functions and Analog Circuits. PhD thesis, Instituto Superior T\u00e9cnico (2001)","DOI":"10.1007\/3-540-45833-6_1"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1006\/jcom.2000.0559","volume":"16","author":"M. Campagnolo","year":"2000","unstructured":"Campagnolo, M., Moore, C., Costa, J.: Iteration, Inequalities, and Differentiability in Analog Computers. Journal of Complexity\u00a016(4), 642\u2013660 (2000)","journal-title":"Journal of Complexity"},{"issue":"4","key":"10_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.: An Analog Characterization of the Grzegorczyk Hierarchy. Journal of Complexity\u00a018(4), 977\u20131000 (2002)","journal-title":"Journal of Complexity"},{"key":"10_CR10","unstructured":"Campagnolo, M., Moore, C., Costa, J.: An Analog Characterization of the Subrecursive Functions. In: 4th Conference on Real Numbers and Computers, pp. 91\u2013109. Odense University Press (2000)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2008.12.004","volume":"221","author":"M. Campagnolo","year":"2008","unstructured":"Campagnolo, M., Ojakian, K.: Characterizing Computable Analysis with Differential Equations. Electronic Notes in Theoretical Computer Science\u00a0221, 23\u201335 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"7-8","key":"10_CR12","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00153-007-0059-x","volume":"46","author":"M. Campagnolo","year":"2008","unstructured":"Campagnolo, M., Ojakian, K.: The Elementary Computable Functions over the Real Numbers: Applying Two New Techniques. Archives for Mathematical Logic\u00a046(7-8), 593\u2013627 (2008)","journal-title":"Archives for Mathematical Logic"},{"key":"10_CR13","unstructured":"Cobham, A.: The Intrinsic Computational Difficulty of Functions. In: Bar-Hillel, Y. (ed.) Proc. of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science, Amsterdam, pp. 24\u201330 (1964)"},{"key":"10_CR14","unstructured":"Gakwaya, J.: A Survey of the Grzegorczyk Hierarchy and its Extension through the BSS Model of Computability. Technical report, Royal Holloway, University of London, NeuroCOLT Technical Report Series (1997)"},{"key":"10_CR15","unstructured":"Gomaa, W.: A Survey of Recursive Analysis and Moore\u2019s Notion of Real Computation (submitted)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Gomaa, W.: Characterizing Polynomial Time Computability of Rational and Real Functions. In: Cooper, B., Danos, V. (eds.) Proceedings of DCM 2009. Electronic Proceedings in Theoretical Computer Science, vol.\u00a09, pp. 54\u201364 (2009)","DOI":"10.4204\/EPTCS.9.7"},{"key":"10_CR17","doi-asserted-by":"publisher","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"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1507244.1507252","volume":"10","author":"A. Kawamura","year":"2009","unstructured":"Kawamura, A.: Differential Recursion. ACM Transactions on Computational Logic\u00a010(3), 1\u201320 (2009)","journal-title":"ACM Transactions on Computational Logic"},{"key":"10_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K. Ko","year":"1991","unstructured":"Ko, K.: Complexity Theory of Real Functions. Birkh\u00e4user, Basel (1991)"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","volume":"38","author":"C. Kreitz","year":"1985","unstructured":"Kreitz, C., Weihrauch, K.: Theory of Representations. Theoretical Computer Science\u00a038, 35\u201353 (1985)","journal-title":"Theoretical Computer Science"},{"key":"10_CR21","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BFb0099489","volume-title":"Computation and Proof Theory","author":"C. Kreitz","year":"1984","unstructured":"Kreitz, C., Weihrauch, K.: A Unified Approach to Constructive and Recursive Analysis. In: CADE 1996. Lecture Notes in Mathematics, vol.\u00a01104, pp. 259\u2013278. Springer, Heidelberg (1984)"},{"key":"10_CR22","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":"10_CR23","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.amc.2007.02.146","volume":"191","author":"B. Loff","year":"2007","unstructured":"Loff, B., Costa, J., Mycka, J.: Computability on Reals, Infinite Limits and Differential Equations. Applied Mathematics and Computation\u00a0191(2), 353\u2013371 (2007)","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"10_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.36045\/bbms\/1105730626","volume":"4","author":"K. Meer","year":"1997","unstructured":"Meer, K., Michaux, C.: A Survey on Real Structural Complexity Theory. Bulletin of the Belgian Mathematical Society\u00a04(1), 113\u2013148 (1997)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"issue":"1","key":"10_CR25","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":"10_CR26","doi-asserted-by":"crossref","unstructured":"Orponen, P.: A Survey of Continous-Time Computation Theory. Advances in Algorithms, Languages, and Complexity, 209\u2013224 (1997)","DOI":"10.1007\/978-1-4613-3394-4_11"},{"issue":"42","key":"10_CR27","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(42), 230\u2013265 (1936) (correction ibid. 43, pp 544\u2013546, 1937)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"10_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction, 1st edn. Springer, Heidelberg (2000)","edition":"1"}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15331-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T10:05:02Z","timestamp":1591869902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15331-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153303","9783642153310"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15331-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}