{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:03:57Z","timestamp":1743041037840,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_16","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"169-180","source":"Crossref","is-referenced-by-count":4,"title":["Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Gra\u00e7a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Pouly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","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. J. Comput. System Sci.\u00a057(3), 389\u2013398 (1998)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jcom.2001.0581","volume":"18","author":"A. Ben-Hur","year":"2002","unstructured":"Ben-Hur, A., Siegelmann, H.T., Fishman, S.: A theory of complexity for continuous time systems. J. Complexity\u00a018(1), 51\u201386 (2002)","journal-title":"J. Complexity"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1006\/jcss.2000.1737","volume":"62","author":"V.D. Blondel","year":"2001","unstructured":"Blondel, V.D., Bournez, O., Koiran, P., Tsitsiklis, J.N.: The stability of saturated linear dynamical systems is undecidable. J. Comput. System Sci.\u00a062, 442\u2013462 (2001)","journal-title":"J. Comput. System Sci."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer (1998)","DOI":"10.1007\/978-1-4612-0701-6"},{"issue":"1","key":"16_CR5","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 and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc.\u00a021(1), 1\u201346 (1989)","journal-title":"Bull. Amer. Math. Soc."},{"issue":"3","key":"16_CR6","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.L., Gra\u00e7a, D.S., Hainry, E.: Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complexity\u00a023(3), 317\u2013335 (2007)","journal-title":"J. Complexity"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Bournez, O., Gra\u00e7a, D.S., Pouly, A.: On the complexity of solving initial value problems. Submitted to the Conference ISSAC 2012: International Symposium on Symbolic and Algebraic Computation (2012)","DOI":"10.1145\/2442829.2442849"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-0-387-68546-5_17","volume-title":"New Computational Paradigms. Changing Conceptions of What is Computable","author":"O. Bournez","year":"2008","unstructured":"Bournez, O., Campagnolo, M.L.: A Survey on Continuous Time Computations. In: New Computational Paradigms. Changing Conceptions of What is Computable, pp. 383\u2013423. Springer, New York (2008)"},{"key":"16_CR9","unstructured":"Brattka, V.: The emperor\u2019s new recursiveness: the epigraph of the exponential function in two models of computability. In: Ito, M., Imaoka, T. (eds.) Words, Languages & Combinatorics III, ICWLC 2000, Kyoto, Japan (2000)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0016-0032(31)90616-9","volume":"212","author":"V. Bush","year":"1931","unstructured":"Bush, V.: The differential analyzer. A new machine for solving differential equations. J. Franklin Inst.\u00a0212, 447\u2013488 (1931)","journal-title":"J. Franklin Inst."},{"issue":"1-2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1019623616675","volume":"1","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S., Pavlov, B.: Coins, quantum measurements, and Turing\u2019s barrier. Quantum Information Processing\u00a01(1-2), 107\u2013127 (2002)","journal-title":"Quantum Information Processing"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1015607401307","volume":"12","author":"B.J. Copeland","year":"2002","unstructured":"Copeland, B.J.: Accelerating Turing machines. Minds and Machines\u00a012, 281\u2013301 (2002)","journal-title":"Minds and Machines"},{"key":"16_CR13","unstructured":"Copeland, J.: Even Turing machines can compute uncomputable functions. In: Casti, J., Calude, C., Dinneen, M. (eds.) Unconventional Models of Computation (UMC 1998), pp. 150\u2013164. Springer (1998)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1093\/bjps\/52.4.671","volume":"52","author":"E.B. Davies","year":"2001","unstructured":"Davies, E.B.: Building infinite machines. The British Journal for the Philosophy of Science\u00a052, 671\u2013682 (2001)","journal-title":"The British Journal for the Philosophy of Science"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.aam.2007.02.003","volume":"40","author":"D.S. Gra\u00e7a","year":"2008","unstructured":"Gra\u00e7a, D.S., Campagnolo, M.L., Buescu, J.: Computability with polynomial differential equations. Adv. Appl. Math.\u00a040(3), 330\u2013349 (2008)","journal-title":"Adv. Appl. Math."},{"issue":"5","key":"16_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/S0885-064X(03)00034-7","volume":"19","author":"D.S. Gra\u00e7a","year":"2003","unstructured":"Gra\u00e7a, D.S., Costa, J.F.: Analog computers and recursive functions over the reals. J. Complexity\u00a019(5), 644\u2013664 (2003)","journal-title":"J. Complexity"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Computational Complexity of Real Functions. Birkh\u00e4user (1991)","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/MAHC.1996.539910","volume":"18","author":"J.M. Nyce","year":"1996","unstructured":"Nyce, J.M.: Guest editor\u2019s introduction. IEEE Ann. Hist. Comput.\u00a018, 3\u20134 (1996)","journal-title":"IEEE Ann. Hist. Comput."},{"key":"16_CR19","unstructured":"Odifreddi, P.: Classical Recursion Theory, vol.\u00a01. Elsevier (1989)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer (1989)","DOI":"10.1007\/978-3-662-21717-7"},{"key":"16_CR21","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 analyzer. J. Math. Phys. MIT\u00a020, 337\u2013354 (1941)","journal-title":"J. Math. Phys. MIT"},{"issue":"7","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1103\/PhysRevLett.83.1463","volume":"83","author":"H.T. Siegelmann","year":"1999","unstructured":"Siegelmann, H.T., Ben-Hur, A., Fishman, S.: Computational complexity for continuous time dynamics. Phys. Rev. Lett.\u00a083(7), 1463\u20131466 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"16_CR23","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Course Technology (2005)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable Analysis: an Introduction. Springer (2000)","DOI":"10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T14:05:57Z","timestamp":1675778757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}