{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:10:08Z","timestamp":1750324208337,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959073","type":"print"},{"value":"9783031959080","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-95908-0_13","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:54:28Z","timestamp":1750323268000},"page":"175-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computability of\u00a0Real Functions with\u00a0Oracle Pointer Machines Implies Real-Time Simulation of\u00a0Chemical Reaction Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7082-023X","authenticated-orcid":false,"given":"Saptarshi","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"13_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms, 1st edn. Addison-Wesley Longman Publishing Co., Inc, USA (1974)","edition":"1"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"114983","DOI":"10.1016\/j.tcs.2024.114983","volume":"1025","author":"DF Anderson","year":"2025","unstructured":"Anderson, D.F., Joshi, B.: Chemical mass-action systems as analog computers: implementing arithmetic computations at specified speed. Theoret. Comput. Sci. 1025, 114983 (2025). https:\/\/doi.org\/10.1016\/j.tcs.2024.114983","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Bournez, O.: Computability, complexity and programming with ordinary differential equations. In: Paul, C., Bl\u00e4ser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 154, pp. 3:1\u20133:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2020.3","DOI":"10.4230\/LIPIcs.STACS.2020.3"},{"issue":"3","key":"13_CR4","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. Complex. 23(3), 317\u2013335 (2007). https:\/\/doi.org\/10.1016\/j.jco.2006.12.005","journal-title":"J. Complex."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-22993-0_18","volume-title":"Mathematical Foundations of Computer Science 2011","author":"O Bournez","year":"2011","unstructured":"Bournez, O., Gra\u00e7a, D.S., Pouly, A.: Solving analytic differential equations in polynomial time over unbounded domains. In: Murlak, F., Sankowski, P. (eds.) Mathematical Foundations of Computer Science 2011, pp. 170\u2013181. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ic.2017.09.015","volume":"257","author":"O Bournez","year":"2017","unstructured":"Bournez, O., Gra\u00e7a, D., Pouly, A.: On the functions generated by the general purpose analog computer. Inf. Comput. 257, 34\u201357 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.09.015","journal-title":"Inf. Comput."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bournez, O., Pouly, A.: A survey on analog models of computation, pp. 173\u2013226. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_6","DOI":"10.1007\/978-3-030-59234-9_6"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/321941.321944","volume":"23","author":"RP Brent","year":"1976","unstructured":"Brent, R.P.: Fast multiple-precision evaluation of elementary functions. J. ACM 23(2), 242\u2013251 (1976). https:\/\/doi.org\/10.1145\/321941.321944","journal-title":"J. ACM"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Cook, M., Soloveichik, D., Winfree, E., Bruck, J.: Programmability of chemical reaction networks, pp. 543\u2013584. Springer, Berlin Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88869-7_27","DOI":"10.1007\/978-3-540-88869-7_27"},{"key":"13_CR10","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.) Computational Methods in Systems Biology, pp. 108\u2013127. Springer International Publishing, Cham (2017)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0022-0000(70)80012-5","volume":"4","author":"PC Fischer","year":"1970","unstructured":"Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Time-restricted sequence generation. J. Comput. Syst. Sci. 4(1), 50\u201373 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Gra\u00c7a, D.S., Zhong, N.: Computability of differential equations, pp. 71\u201399. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_3","DOI":"10.1007\/978-3-030-59234-9_3"},{"issue":"3","key":"13_CR13","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). https:\/\/doi.org\/10.1016\/j.aam.2007.02.003","journal-title":"Adv. Appl. Math."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-51237-3_10","volume-title":"Logic at Botik \u201989","author":"Y Gurevich","year":"1989","unstructured":"Gurevich, Y., Shelah, S.: Nearly linear time. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik \u201989, pp. 108\u2013118. Springer, Berlin Heidelberg, Berlin, Heidelberg (1989)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 285\u2013306 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-030-26807-7_3","volume-title":"DNA Computing and Molecular Programming","author":"X Huang","year":"2019","unstructured":"Huang, X., Klinge, T.H., Lathrop, J.I.: Real-time equivalence of chemical reaction networks and analog computers. In: Thachuk, C., Liu, Y. (eds.) DNA Computing and Molecular Programming, pp. 37\u201353. Springer International Publishing, Cham (2019)"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s11047-018-9706-x","volume":"18","author":"X Huang","year":"2019","unstructured":"Huang, X., Klinge, T.H., Lathrop, J.I., Li, X., Lutz, J.H.: Real-time computability of real numbers by chemical reaction networks. Nat. Comput. 18(1), 63\u201373 (2019). https:\/\/doi.org\/10.1007\/s11047-018-9706-x","journal-title":"Nat. Comput."},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Kawamura, A.: Lipschitz continuous ordinary differential equations are polynomial-space complete. In: 2009 24th Annual IEEE Conference on Computational Complexity, pp. 149\u2013160 (2009). https:\/\/doi.org\/10.1109\/CCC.2009.34","DOI":"10.1109\/CCC.2009.34"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Ko, K.I.: Complexity theory of real functions. Birkhauser Boston Inc., 1st edition edn. (1991). https:\/\/doi.org\/10.1007\/978-1-4684-6802-1","DOI":"10.1007\/978-1-4684-6802-1"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"KI Ko","year":"1982","unstructured":"Ko, K.I., Friedman, H.: Computational complexity of real functions. Theoret. Comput. Sci. 20(3), 323\u2013352 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR21","first-page":"3","volume":"13","author":"AN Kolmogorov","year":"1958","unstructured":"Kolmogorov, A.N., Uspenskii, V.A.: On the definition of an algorithm. Russ. Math. Surv. 13, 3\u201328 (1958)","journal-title":"Russ. Math. Surv."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2016.02.002","volume":"626","author":"A Pouly","year":"2016","unstructured":"Pouly, A., Gra\u00e7a, D.S.: Computational complexity of solving polynomial differential equations over unbounded domains. Theoret. Comput. Sci. 626, 67\u201382 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.02.002","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF02759719","volume":"1","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Real time computation. Israel J. Math. 1, 203\u2013211 (1963). https:\/\/doi.org\/10.1007\/BF02759719","journal-title":"Israel J. Math."},{"key":"13_CR24","volume-title":"Div, Grad, Curl, and All that: An Informal Text on Vector Calculus","author":"H Schey","year":"2005","unstructured":"Schey, H.: Div, Grad, Curl, and All that: An Informal Text on Vector Calculus. Norton, W.W (2005)"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A.: Storage modification machines. SIAM J. Comput. 9(3), 490\u2013508 (1980). https:\/\/doi.org\/10.1137\/0209036","journal-title":"SIAM J. Comput."},{"issue":"12","key":"13_CR26","doi-asserted-by":"publisher","first-page":"5393","DOI":"10.1073\/pnas.0909380107","volume":"107","author":"D Soloveichik","year":"2010","unstructured":"Soloveichik, D., Seelig, G., Winfree, E.: Dna as a universal substrate for chemical kinetics. Proc. Natl. Acad. Sci. 107(12), 5393\u20135398 (2010). https:\/\/doi.org\/10.1073\/pnas.0909380107","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Crossroads of Computability and Logic: Insights, Inspirations, and Innovations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95908-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:54:30Z","timestamp":1750323270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95908-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959073","9783031959080"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95908-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The National Science Foundation, USA, has funded the paper\u2019s author.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cie2025-computabilityineurope\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}