{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:23Z","timestamp":1784484143129,"version":"3.55.0"},"publisher-location":"Cham","reference-count":83,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_1","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:28:54Z","timestamp":1784482134000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ordinary Differential Equations as\u00a0a\u00a0Universal Language for\u00a0Computability and\u00a0Complexity: From Polynomial Time to\u00a0the\u00a0Hyperarithmetical Hierarchy"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Agostini, N.B., Johnson, C., Cannon, W.R., Tumeo, A.: Chemcomp: a compilation framework for computing with chemical reaction networks (2025). https:\/\/doi.org\/10.1145\/3658617.3703315","DOI":"10.1145\/3658617.3703315"},{"key":"1_CR2","unstructured":"Allender, E.: Circuit complexity, kolmogorov complexity, and prospects for lower bounds. In: C\u00e2mpeanu, C., Pighizzini, G. (eds.) 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, pp. 7\u201313. University of Prince Edward Island, Citeseer (2008)"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Allender, E., Buhrman, H., Kouck\u00fd, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(6), 1467\u20131493 (2006). https:\/\/doi.org\/10.1137\/050628994","DOI":"10.1137\/050628994"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Ambaram, T., Beggs, E., Costa, J.F., Po\u00e7as, D., Tucker, J.V.: An analogue-digital model of computation: turing machines with physical oracles. In: Advances in Unconventional Computing, pp. 73\u2013115. Springer (2017)","DOI":"10.1007\/978-3-319-33924-5_4"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Antonelli, M., Durand, A., Kontinen, J.: A new characterization of FAC$$^0$$ via discrete ordinary differential equations. In: Kr\u00e1lovic, R., Kucera, A. (eds.) 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 26\u201330 August 2024. LIPIcs, vol.\u00a0306, pp. 10:1\u201310:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2024.10","DOI":"10.4230\/LIPICS.MFCS.2024.10"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Antonelli, M., Durand, A., Kontinen, J.: Characterizing small circuit classes from FAC$$^0$$ to FAC$$^1$$ via discrete ordinary differential equations. In: Gawrychowski, P., Mazowiecki, F., Skrzypczak, M. (eds.) 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025. LIPIcs, vol.\u00a0345, pp. 10:1\u201310:18 (2025). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2025.10","DOI":"10.4230\/LIPICS.MFCS.2025.10"},{"issue":"2098","key":"1_CR7","doi-asserted-by":"publisher","first-page":"2777","DOI":"10.1098\/rspa.2008.0085","volume":"464","author":"E Beggs","year":"2008","unstructured":"Beggs, E., Costa, J.F., Loff, B., Tucker, J.V.: Computational complexity with experiments as oracles. Proc. Roy. Soc. London-A 464(2098), 2777 (2008). https:\/\/doi.org\/10.1098\/rspa.2008.0085","journal-title":"Proc. Roy. Soc. London-A"},{"issue":"2","key":"1_CR8","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 poly-time functions. Comput. Complex. 2(2), 97\u2013110 (1992). https:\/\/doi.org\/10.1007\/bf01201998","journal-title":"Comput. Complex."},{"key":"1_CR9","doi-asserted-by":"publisher","DOI":"10.3390\/electronics14163159","author":"L Belostotski","year":"2025","unstructured":"Belostotski, L., Uddin, A., Madanayake, A., Mandal, S.: A survey of analog computing for domain-specific accelerators. Electronics (2025). https:\/\/doi.org\/10.3390\/electronics14163159","journal-title":"Electronics"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Biswas, S.: Computability of real functions with oracle pointer machines implies real-time simulation of chemical reaction networks. Lecture Notes in Computer Science (2025). https:\/\/doi.org\/10.1007\/978-3-031-95908-0_13","DOI":"10.1007\/978-3-031-95908-0_13"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Blanc, M., Bournez, O.: A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations: simulation of turing machines with analytic discrete ODEs. In: Leroux, J., Lombardy, S., Peleg, D. (eds.) 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. LIPIcs, vol.\u00a0272, pp. 21:1\u201321:15 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2023.21","DOI":"10.4230\/LIPIcs.MFCS.2023.21"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Blanc, M., Bournez, O.: The complexity of computing in continuous time: space complexity is precision. In: Bringmann, K., Grohe, M., Puppis, G., Svensson, O. (eds.) 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. LIPIcs, vol.\u00a0297, pp. 129:1\u2013129:22 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2024.129","DOI":"10.4230\/LIPIcs.ICALP.2024.129"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Blanc, M., Bournez, O.: Quantifiying the robustness of dynamical systems. Relating time and space to length and precision. In: Murano, A., Silva, A. (eds.) 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024. LIPIcs, vol.\u00a0288, pp. 17:1\u201317:20. Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2024.17","DOI":"10.4230\/LIPIcs.CSL.2024.17"},{"key":"1_CR14","unstructured":"Bournez, O.: Primitive recursion without composition: dynamical characterizations, from neural networks to polynomial odes. Technical report (2026). https:\/\/arxiv.org\/abs\/2604.24356"},{"key":"1_CR15","unstructured":"Bournez, O.: Uniform Computation and Complexity in Deep\u2013Narrow Neural Networks (2026)"},{"key":"1_CR16","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/j.jco.2006.12.005","DOI":"10.1016\/j.jco.2006.12.005"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Bournez, O., Cohen, J., Wurm, A.: A universal uniform approximation theorem for neural networks. In: Gawrychowski, P., Mazowiecki, F., Skrzypczak, M. (eds.) 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025. LIPIcs, vol.\u00a0345, pp. 29:1\u201329:20. Dagstuhl, Germany (2025). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2025.29","DOI":"10.4230\/LIPIcs.MFCS.2025.29"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Bournez, O., Durand, A.: A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations. Comput. Complex. 32(2), 7 (2023). https:\/\/doi.org\/10.1007\/s00037-023-00240-1","DOI":"10.1007\/s00037-023-00240-1"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Bournez, O., Gozzi, R.: Solvable initial value problems ruled by discontinuous ordinary differential equations. Technical report (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.00165","DOI":"10.48550\/arXiv.2405.00165"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Bournez, O., Gozzi, R.: Solving discontinuous initial value problems with unique solutions is equivalent to computing over the transfinite. In: Symposium on Theoretical Aspects of Computer Science (STACS), Clermont-Ferrand, France (2024). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2024.20","DOI":"10.4230\/LIPIcs.STACS.2024.20"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Bournez, O., Gozzi, R., Gra\u00e7a, D.S., Pouly, A.: A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. 77, 101755 (2023). https:\/\/doi.org\/10.1016\/j.jco.2023.101755","DOI":"10.1016\/j.jco.2023.101755"},{"key":"1_CR22","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/3127496","DOI":"10.1145\/3127496"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Bournez, O., N\u00fa\u00f1ez, A.: Relating the computational and logical difficulty of solving odes: from polynomial to discontinuous right-hand sides. In: Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC 2026) (2026)","DOI":"10.1145\/3815436.3815454"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Bournez, O., Pouly, A.: A universal ordinary differential equation. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. LIPIcs, vol.\u00a080, pp. 116:1\u2013116:14 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.116","DOI":"10.4230\/LIPIcs.ICALP.2017.116"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Bournez, O., Pouly, A.: A universal ordinary differential equation. Log. Methods Comput. Sci. 16(1) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(1:28)2020","DOI":"10.23638\/LMCS-16(1:28)2020"},{"key":"1_CR26","doi-asserted-by":"publisher","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. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_6","DOI":"10.1007\/978-3-030-59234-9_6"},{"issue":"4","key":"1_CR27","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 analyser. J. Franklin Inst. 212(4), 447\u2013488 (1931)","journal-title":"J. Franklin Inst."},{"key":"1_CR28","doi-asserted-by":"publisher","DOI":"10.1137\/23m1561129","author":"A Bychkov","year":"2024","unstructured":"Bychkov, A., Issan, O., Pogudin, G., Kr\u00e4mer, B.: Exact and optimal quadratization of nonlinear finite-dimensional nonautonomous dynamical systems. SIAM J. Appl. Dyn. Syst. (2024). https:\/\/doi.org\/10.1137\/23m1561129","journal-title":"SIAM J. Appl. Dyn. Syst."},{"key":"1_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2025.122104","author":"J Cabessa","year":"2025","unstructured":"Cabessa, J., Strozecki, Y.: Refined kolmogorov complexity of analog, evolving and stochastic recurrent neural networks. Inf. Sci. (2025). https:\/\/doi.org\/10.1016\/j.ins.2025.122104","journal-title":"Inf. Sci."},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Cai, Y., Pogudin, G.: Dissipative quadratizations of polynomial ode systems. Lecture Notes in Computer Science (2024). https:\/\/doi.org\/10.1007\/978-3-031-57249-4_16","DOI":"10.1007\/978-3-031-57249-4_16"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Calabrese, K., Doty, D.: Rate-independent continuous inhibitory chemical reaction networks are turing-universal. Lecture Notes in Computer Science (2024). https:\/\/doi.org\/10.1007\/978-3-031-63742-1_8","DOI":"10.1007\/978-3-031-63742-1_8"},{"key":"1_CR32","doi-asserted-by":"publisher","DOI":"10.1093\/imrn\/rnab233","author":"R Cardona","year":"2021","unstructured":"Cardona, R., Miranda, E., Peralta-Salas, D.: Turing universality of the incompressible euler equations and a conjecture of moore. Int. Math. Res. Not. (2021). https:\/\/doi.org\/10.1093\/imrn\/rnab233","journal-title":"Int. Math. Res. Not."},{"key":"1_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpur.2022.11.007","author":"R Cardona","year":"2022","unstructured":"Cardona, R., Miranda, E., Peralta-Salas, D.: Computability and beltrami fields in euclidean space. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es (2022). https:\/\/doi.org\/10.1016\/j.matpur.2022.11.007","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"1_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-025-09699-6","author":"R Cardona","year":"2025","unstructured":"Cardona, R., Miranda, E., Peralta-Salas, D.: Towards a fluid computer. Found. Comput. Math. (2025). https:\/\/doi.org\/10.1007\/s10208-025-09699-6","journal-title":"Found. Comput. Math."},{"key":"1_CR35","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2026818118","author":"R Cardona","year":"2021","unstructured":"Cardona, R., Miranda, E., Peralta-Salas, D., Presas, F.: Constructing turing complete euler flows in dimension 3. Proc. Natl. Acad. Sci. (2021). https:\/\/doi.org\/10.1073\/pnas.2026818118","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1_CR36","doi-asserted-by":"publisher","DOI":"10.1145\/3590776","author":"HL Chen","year":"2023","unstructured":"Chen, H.L., Doty, D., Reeves, W., Soloveichik, D.: Rate-independent computation in continuous chemical reaction networks. J. ACM (2023). https:\/\/doi.org\/10.1145\/3590776","journal-title":"J. ACM"},{"key":"1_CR37","unstructured":"Chen, T.Q., Rubanova, Y., Bettencourt, J., Duvenaud, D.: Neural ordinary differential equations. In: Bengio, S., Wallach, H.M., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018. pp. 6572\u20136583 (2018). https:\/\/proceedings.neurips.cc\/paper\/2018\/hash\/69386f6bb1dfed68692a24c8686939b9-Abstract.html"},{"key":"1_CR38","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/4056","author":"MT Chu","year":"2024","unstructured":"Chu, M.T.: Preparing hamiltonians for quantum simulation: a computational framework for cartan decomposition via lax dynamics. Math. Comput. (2024). https:\/\/doi.org\/10.1090\/mcom\/4056","journal-title":"Math. Comput."},{"key":"1_CR39","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2019.0790","author":"S Clamons","year":"2020","unstructured":"Clamons, S., Qian, L., Winfree, E.: Programming and simulating chemical reaction networks on a surface. J. R. Soc. Interface (2020). https:\/\/doi.org\/10.1098\/rsif.2019.0790","journal-title":"J. R. Soc. Interface"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Clote, P., Kranakis, E.: Boolean Functions and Computation Models. Texts in Theoretical Computer Science. An EATCS Series. Springer (2002). https:\/\/doi.org\/10.1007\/978-3-662-04943-3","DOI":"10.1007\/978-3-662-04943-3"},{"key":"1_CR41","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pp. 24\u201330. North-Holland, Amsterdam (1962)"},{"key":"1_CR42","doi-asserted-by":"publisher","DOI":"10.1017\/s096012952000002x","author":"P Collins","year":"2020","unstructured":"Collins, P.: Computable analysis with applications to dynamic systems. Math. Struct. Comput. Sci. (2020). https:\/\/doi.org\/10.1017\/s096012952000002x","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Collins, P., Gra\u00e7a, D.S.: Effective computability of solutions of differential inclusions the ten thousand monkeys approach. J. Univ. Comput. Sci. 15(6), 1162\u20131185 (2009). https:\/\/doi.org\/10.3217\/jucs-015-06-1162","DOI":"10.3217\/jucs-015-06-1162"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control. Signals Syst. 2(4), 303\u2013314 (1989). https:\/\/doi.org\/10.1007\/BF02551274","DOI":"10.1007\/BF02551274"},{"key":"1_CR45","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":"1_CR46","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2025.3554428","author":"Y Fan","year":"2025","unstructured":"Fan, Y., Zhang, X., Gao, C., Dochain, D.: Automatic implementation of neural networks through reaction networks\u2013part i: circuit design and convergence analysis. IEEE Trans. Autom. Control (2025). https:\/\/doi.org\/10.1109\/tac.2025.3554428","journal-title":"IEEE Trans. Autom. Control"},{"key":"1_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-024-09994-1","author":"W Fletcher","year":"2024","unstructured":"Fletcher, W., Klinge, T.H., Lathrop, J.I., Nye, D.A., Rayman, M.: Real-time computing and robust memory with deterministic chemical reaction networks. Nat. Comput. (2024). https:\/\/doi.org\/10.1007\/s11047-024-09994-1","journal-title":"Nat. Comput."},{"key":"1_CR48","doi-asserted-by":"publisher","unstructured":"Gozzi, R., Bournez, O.: Set descriptive complexity of solvable functions. Technical report (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.19304","DOI":"10.48550\/arXiv.2405.19304"},{"key":"1_CR49","doi-asserted-by":"publisher","unstructured":"Gra\u00e7a, D.S.: Computation with real numbers and continuous-time dynamical systems. In: Crossroads of Computability and Logic: Insights, Inspirations, and Innovations: 21st Conference on Computability in Europe, CiE 2025 (2025). https:\/\/doi.org\/10.1007\/978-3-031-95908-0_5","DOI":"10.1007\/978-3-031-95908-0_5"},{"issue":"5","key":"1_CR50","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). https:\/\/doi.org\/10.1016\/s0885-064x(03)00034-7","journal-title":"J. Complex."},{"key":"1_CR51","doi-asserted-by":"publisher","DOI":"10.3233\/com-210381","author":"DS Gra\u00e7a","year":"2022","unstructured":"Gra\u00e7a, D.S., Zhong, N.: Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate turing machines. Computability (2022). https:\/\/doi.org\/10.3233\/com-210381","journal-title":"Computability"},{"key":"1_CR52","doi-asserted-by":"publisher","unstructured":"Gra\u00e7a, D.S.: Some recent developments on shannon\u2019s general purpose analog computer. Math. Logic Q. 50(4-5), 473\u2013485 (2004). https:\/\/doi.org\/10.1002\/malq.200310113","DOI":"10.1002\/malq.200310113"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Hemery, M., Fages, F.: Algebraic biochemistry: A framework for analog online computation in cells. Lecture Notes in Computer Science (2022). https:\/\/doi.org\/10.1007\/978-3-031-15034-0_1","DOI":"10.1007\/978-3-031-15034-0_1"},{"key":"1_CR54","doi-asserted-by":"publisher","unstructured":"Hemery, M., Fages, F.: On estimating derivatives of input signals in biochemistry. Lecture Notes in Computer Science (2023). https:\/\/doi.org\/10.1007\/978-3-031-42697-1_6","DOI":"10.1007\/978-3-031-42697-1_6"},{"key":"1_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-030-60327-4_7","volume-title":"Computational Methods in Systems Biology","author":"M Hemery","year":"2020","unstructured":"Hemery, M., Fages, F., Soliman, S.: On the complexity of quadratization for polynomial differential equations. In: Abate, A., Petrov, T., Wolf, V. (eds.) CMSB 2020. LNCS, vol. 12314, pp. 120\u2013140. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60327-4_7"},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-85633-5_5","volume-title":"Computational Methods in Systems Biology","author":"M Hemery","year":"2021","unstructured":"Hemery, M., Fages, F., Soliman, S.: Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs. In: Cinquemani, E., Paulev\u00e9, L. (eds.) CMSB 2021. LNCS, vol. 12881, pp. 74\u201390. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85633-5_5"},{"key":"1_CR57","doi-asserted-by":"publisher","unstructured":"Huang, X., Migunov, A.N.: A general purpose analog computer to population protocol compiler (2024). https:\/\/doi.org\/10.1145\/3637543.3654758","DOI":"10.1145\/3637543.3654758"},{"key":"1_CR58","doi-asserted-by":"publisher","DOI":"10.1038\/s41570-026-00796-w","author":"X Ji","year":"2026","unstructured":"Ji, X., Chen, Y., Yu, X., Nijhuis, C.A.: Making chemistry compute with non-steady-state chemical dynamics. Nat. Rev. Chem. (2026). https:\/\/doi.org\/10.1038\/s41570-026-00796-w","journal-title":"Nat. Rev. Chem."},{"key":"1_CR59","doi-asserted-by":"publisher","unstructured":"Johnson, C., Agostini, N.B., Cannon, W.R., Tumeo, A.: Energy-efficient scientific computing using chemical reservoirs. NPJ Unconventional Computing (2026). https:\/\/doi.org\/10.1038\/s44335-026-00053-9","DOI":"10.1038\/s44335-026-00053-9"},{"key":"1_CR60","doi-asserted-by":"publisher","unstructured":"Kidger, P.: On neural differential equations. CoRR abs\/2202.02435 (2022). https:\/\/doi.org\/10.48550\/arXiv.2202.02435. https:\/\/arxiv.org\/abs\/2202.02435","DOI":"10.48550\/arXiv.2202.02435"},{"key":"1_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-024-09982-5","author":"TH Klinge","year":"2024","unstructured":"Klinge, T.H., Lathrop, J.I., Osera, P.M., Rogers, A.: Reactamole: functional reactive molecular programming. Nat. Comput. (2024). https:\/\/doi.org\/10.1007\/s11047-024-09982-5","journal-title":"Nat. Comput."},{"key":"1_CR62","doi-asserted-by":"publisher","DOI":"10.5194\/ars-19-105-2021","author":"S K\u00f6ppel","year":"2021","unstructured":"K\u00f6ppel, S., Ulmann, B., Heimann, L., Killat, D.: Using analog computers in today\u2019s largest computational challenges. Adv. Radio Sci. (2021). https:\/\/doi.org\/10.5194\/ars-19-105-2021","journal-title":"Adv. Radio Sci."},{"key":"1_CR63","doi-asserted-by":"publisher","unstructured":"Lee, Y.X., Chen, H.L.: On the simulation power of surface chemical reaction networks. Lecture Notes in Computer Science (2024). https:\/\/doi.org\/10.1007\/978-3-031-63742-1_11","DOI":"10.1007\/978-3-031-63742-1_11"},{"key":"1_CR64","doi-asserted-by":"publisher","unstructured":"Leivant, D., Marion, J.: A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci. 236(1-2), 193\u2013208 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00209-1","DOI":"10.1016\/S0304-3975(99)00209-1"},{"key":"1_CR65","doi-asserted-by":"publisher","unstructured":"Leivant, D., Marion, J.Y.: Math. Struct. Comput. Sci. (2020). https:\/\/doi.org\/10.1017\/s0960129519000112","DOI":"10.1017\/s0960129519000112"},{"key":"1_CR66","doi-asserted-by":"publisher","unstructured":"Lipshitz, L., Rubel, L.A.: A differentially algebraic replacement theorem, and analog computability. Proc. Am. Math. Soc. 99(2), 367\u2013372 (1987). https:\/\/doi.org\/10.1090\/s0002-9939-1987-0870803-1","DOI":"10.1090\/s0002-9939-1987-0870803-1"},{"key":"1_CR67","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2025.06.004","author":"\u00c1 Perales-Eceiza","year":"2025","unstructured":"Perales-Eceiza, \u00c1., Cubitt, T., Gu, M., P\u00e9rez-Garc\u00eda, D., Wolf, M.M.: Undecidability in physics: a review. Phys. Rep. (2025). https:\/\/doi.org\/10.1016\/j.physrep.2025.06.004","journal-title":"Phys. Rep."},{"key":"1_CR68","doi-asserted-by":"publisher","DOI":"10.1145\/3763228","author":"A Platzer","year":"2025","unstructured":"Platzer, A., Qian, L.: Axiomatization of compact initial value problems: open properties. J. ACM (2025). https:\/\/doi.org\/10.1145\/3763228","journal-title":"J. ACM"},{"key":"1_CR69","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exaa081","author":"D Po\u00e7as","year":"2020","unstructured":"Po\u00e7as, D., Zucker, J.I.: Tracking computability of GPAC-generable functions. J. Log. Comput. (2020). https:\/\/doi.org\/10.1093\/logcom\/exaa081","journal-title":"J. Log. Comput."},{"key":"1_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1996870","volume":"199","author":"MB 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). Trans. Am. Math. Soc. 199, 1\u201328 (1974). https:\/\/doi.org\/10.2307\/1996870","journal-title":"Trans. Am. Math. Soc."},{"key":"1_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-11295-4_8","volume-title":"DNA Computing and Molecular Programming","author":"L Qian","year":"2014","unstructured":"Qian, L., Winfree, E.: Parallel and scalable computation and spatial dynamics with DNA-based chemical reaction networks on a surface. In: Murata, S., Kobayashi, S. (eds.) DNA 2014. LNCS, vol. 8727, pp. 114\u2013131. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11295-4_8"},{"key":"1_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-030-85165-1_21","volume-title":"Computer Algebra in Scientific Computing","author":"S Selivanova","year":"2021","unstructured":"Selivanova, S., Steinberg, F., Thies, H., Ziegler, M.: Exact real computation of solution operators for linear analytic systems of partial differential equations. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2021. LNCS, vol. 12865, pp. 370\u2013390. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85165-1_21"},{"key":"1_CR73","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). https:\/\/doi.org\/10.1002\/sapm1941201337","journal-title":"J. Math. Phys. MIT"},{"key":"1_CR74","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2026.106359","author":"X Shi","year":"2026","unstructured":"Shi, X., Gao, C., Dochain, D., Fan, Y.: Biochemical relaxation oscillator designed to control molecular computation. Syst. Control Lett. (2026). https:\/\/doi.org\/10.1016\/j.sysconle.2026.106359","journal-title":"Syst. Control Lett."},{"key":"1_CR75","doi-asserted-by":"publisher","DOI":"10.1088\/2632-072x\/adb928","author":"L Sidl","year":"2025","unstructured":"Sidl, L., et al.: Computational complexity, algorithmic scope, and evolution. J. Phys. Complex. (2025). https:\/\/doi.org\/10.1088\/2632-072x\/adb928","journal-title":"J. Phys. Complex."},{"key":"1_CR76","doi-asserted-by":"crossref","unstructured":"Siegelmann, H.T.: Neural networks and analog computation - beyond the Turing limit. Progress in theoretical computer science, Birkh\u00e4user (1999)","DOI":"10.1007\/978-1-4612-0707-8"},{"issue":"6","key":"1_CR77","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0893-9659(91)90080-f","volume":"4","author":"HT Siegelmann","year":"1991","unstructured":"Siegelmann, H.T., Sontag, E.D.: Turing computability with neural nets. Appl. Math. Lett. 4(6), 77\u201380 (1991). https:\/\/doi.org\/10.1016\/0893-9659(91)90080-f","journal-title":"Appl. Math. Lett."},{"key":"1_CR78","doi-asserted-by":"publisher","unstructured":"Siegelmann, H.T., Sontag, E.D.: Analog computation via neural networks. Theor. Comput. Sci. 131(2), 331\u2013360 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90178-3","DOI":"10.1016\/0304-3975(94)90178-3"},{"key":"1_CR79","doi-asserted-by":"publisher","unstructured":"Vasi\u0107, M., Chalk, C., Khurshid, S., Soloveichik, D.: Deep molecular programming: a natural implementation of binary-weight relu neural networks. arXiv (Cornell University) (2020). https:\/\/doi.org\/10.48550\/arxiv.2003.13720","DOI":"10.48550\/arxiv.2003.13720"},{"issue":"2","key":"1_CR80","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11047-019-09775-1","volume":"19","author":"M Vasi\u0107","year":"2020","unstructured":"Vasi\u0107, M., Soloveichik, D., Khurshid, S.: CRN++: molecular programming language. Nat. Comput. 19(2), 391\u2013407 (2020). https:\/\/doi.org\/10.1007\/s11047-019-09775-1","journal-title":"Nat. Comput."},{"key":"1_CR81","doi-asserted-by":"crossref","unstructured":"Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer (1999)","DOI":"10.1007\/978-3-662-03927-4"},{"key":"1_CR82","doi-asserted-by":"publisher","unstructured":"E, W.: A proposal on machine learning via dynamical systems. Commun. Math. Stat. 5(1), 1\u201311 (2017). https:\/\/doi.org\/10.1007\/s40304-017-0103-z","DOI":"10.1007\/s40304-017-0103-z"},{"key":"1_CR83","doi-asserted-by":"publisher","DOI":"10.1007\/s41965-024-00149-w","author":"S Yu","year":"2024","unstructured":"Yu, S., Lee, J., Isokawa, T.: Universality of a surface chemical reaction network using only bi-molecular reactions. J. Membr. Comput. (2024). https:\/\/doi.org\/10.1007\/s41965-024-00149-w","journal-title":"J. Membr. Comput."}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:00Z","timestamp":1784482140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","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":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}