{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:41:32Z","timestamp":1757616092088,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031087394"},{"type":"electronic","value":"9783031087400"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08740-0_4","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T14:33:51Z","timestamp":1656167631000},"page":"39-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Programming with\u00a0Ordinary Differential Equations: Some First Steps Towards a\u00a0Programming Language"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"4_CR1","unstructured":"Hainry, E.: Mod\u00e8les de calculs sur les r\u00e9els. R\u00e9sultats de Comparaisons. Ph.D. thesis, LORIA, 7 D\u00e9cembre 2006"},{"key":"4_CR2","unstructured":"Gra\u00e7a, D.S.: Computability with polynomial differential equations. Ph.D. thesis, Instituto Superior T\u00e9cnico (2007)"},{"key":"4_CR3","unstructured":"Pouly, A.: Continuous models of computation: from computability to complexity. Ph.D. thesis, Ecole Polytechnique and Unidersidade Do Algarve, Defended on 6 July 2015 (2015). https:\/\/pastel.archives-ouvertes.fr\/tel-01223284. Prix de Th\u00e8se de l\u2019Ecole Polyechnique 2016, Ackermann Award 2017"},{"key":"4_CR4","unstructured":"Gozzi, R.: Analog characterization of complexity classes. Ph.D. thesis, Instituto Superior T\u00e9cnico, Lisbon, Portugal and University of Algarve, Faro, Portugal (2022)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bournez, O., Pouly, A.: A universal ordinary differential equation. Logical Methods Comput. Sci. 16(1) (2020)","DOI":"10.23638\/LMCS-16(1:28)2020"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-67471-1_7","volume-title":"Computational Methods in Systems Biology","author":"F Fages","year":"2017","unstructured":"Fages, F., Le Guludec, G., Bournez, O., Pouly, A.: Strong turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs. In: Feret, J., Koeppl, H. (eds.) CMSB 2017. LNCS, vol. 10545, pp. 108\u2013127. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67471-1_7"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bournez, O., Gra\u00e7a, D.S., Pouly, A.: Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length. J. ACM 64(6), 38:1\u201338:76 (2017)","DOI":"10.1145\/3127496"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.aam.2007.02.003","volume":"40","author":"DS Gra\u00e7a","year":"2008","unstructured":"Gra\u00e7a, D.S., Campagnolo, M.L., Buescu, J.: Computability with polynomial differential equations. Adv. Appl. Math. 40(3), 330\u2013349 (2008)","journal-title":"Adv. Appl. Math."},{"key":"4_CR9","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-030-59234-9_6","volume-title":"Handbook of Computability and Complexity in Analysis","author":"O Bournez","year":"2021","unstructured":"Bournez, O., Pouly, A.: A survey on analog models of computation. In: Brattka, V., Hertling, P. (eds.) Handbook of Computability and Complexity in Analysis. TAC, pp. 173\u2013226. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_6"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bournez, O., Campagnolo, M.L.: New Computational Paradigms. Changing Conceptions of What is Computable, pp. 383\u2013423. Springer, New York (2008)","DOI":"10.1007\/978-0-387-68546-5_17"},{"key":"4_CR11","doi-asserted-by":"crossref","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 (1997)","DOI":"10.1007\/978-1-4613-3394-4_11"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Ulmann, B.: Analog and Hybrid Computer Programming. De Gruyter Oldenbourg (2020)","DOI":"10.1515\/9783110662207"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Ulmann, B.: Analog Computing. Walter de Gruyter (2013)","DOI":"10.1524\/9783486755183"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-0-387-30440-3_19","volume-title":"Encyclopedia of Complexity and Systems Science","author":"BJ MacLennan","year":"2009","unstructured":"MacLennan, B.J.: Analog computation. In: Meyers, R. (ed.) Encyclopedia of Complexity and Systems Science, pp. 271\u2013294. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-30440-3_19"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/sapm1941201337","volume":"20","author":"CE Shannon","year":"1941","unstructured":"Shannon, C.E.: Mathematical theory of the differential analyser. J. Math. Phys. MIT 20, 337\u2013354 (1941)","journal-title":"J. Math. Phys. MIT"},{"issue":"5","key":"4_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/S0885-064X(03)00034-7","volume":"19","author":"DS Gra\u00e7a","year":"2003","unstructured":"Gra\u00e7a, D.S., Costa, J.F.: Analog computers and recursive functions over the reals. J. Complex. 19(5), 644\u2013664 (2003)","journal-title":"J. Complex."},{"key":"4_CR17","doi-asserted-by":"crossref","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. Complex. 23(3), 317\u2013335 (2007)","DOI":"10.1016\/j.jco.2006.12.005"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Bournez, O., Gozzi, R., Gra\u00e7a, D.S., Pouly, A.: A continuous characterization of PSPACE using polynomial ordinary differential equations (2022)","DOI":"10.1016\/j.jco.2023.101755"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Gozzi, R., Gra\u00e7a, D.S.: Characterizing time computational complexity classes with polynomial differential equations (2022, submitted)","DOI":"10.3233\/COM-210384"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(94)00147-B","volume":"138","author":"MS Branicky","year":"1995","unstructured":"Branicky, M.S.: Universal computation and other capabilities of hybrid and continuous dynamical systems. Theor. Comput. Sci. 138(1), 67\u2013100 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1090\/S0273-0979-1981-14910-7","volume":"4","author":"LA Rubel","year":"1981","unstructured":"Rubel, L.A.: A universal differential equation. Bull. Am. Math. Soc. 4(3), 345\u2013349 (1981)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.2307\/1971279","volume":"124","author":"M Boshernitzan","year":"1986","unstructured":"Boshernitzan, M.: Universal formulae and universal differential equations. Ann. Math. 124(2), 273\u2013291 (1986)","journal-title":"Ann. Math."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-88869-7_27","volume-title":"Algorithmic Bioprocesses","author":"M Cook","year":"2009","unstructured":"Cook, M., Soloveichik, D., Winfree, E., Bruck, J.: Programmability of chemical reaction networks. In: Condon, A., Harel, D., Kok, J., Salomaa, A., Winfree, E. (eds.) Algorithmic Bioprocesses, pp. 543\u2013584. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88869-7_27"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0003-4843(79)90021-4","volume":"17","author":"MB Pour-El","year":"1979","unstructured":"Pour-El, M.B., Richards, J.I.: A computable ordinary differential equation which possesses no computable solution. Ann. Math. Logic 17, 61\u201390 (1979)","journal-title":"Ann. Math. Logic"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.entcs.2008.12.010","volume":"221","author":"P Collins","year":"2008","unstructured":"Collins, P., Gra\u00e7a, D.S.: Effective computability of solutions of ordinary differential equations the thousand monkeys approach. Electron. Notes Theor. Comput. Sci. 221, 103\u2013114 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Revolutions and Revelations in Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08740-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T17:52:30Z","timestamp":1757094750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08740-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087394","9783031087400"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08740-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Swansea","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.swansea.ac.uk\/cie2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}