{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T22:26:24Z","timestamp":1773786384257,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00224-026-10269-8","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:50:38Z","timestamp":1773773438000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Practical Extension of Computational Complexity Theory for Applications in Mathematics and Sciences"],"prefix":"10.1007","volume":"70","author":[{"given":"Jingnan","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-Sheng","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Harry B.","family":"Hunt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard E.","family":"Stearns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"10269_CR1","doi-asserted-by":"publisher","unstructured":"Vasco Brattka, P.H. (ed.): Handbook of Computability and Complexity in Analysis. Theory and Applications of Computability. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9","DOI":"10.1007\/978-3-030-59234-9"},{"key":"10269_CR2","doi-asserted-by":"publisher","unstructured":"Steinberg, F., Th\u00e9ry, L., Thies, H.: Computable analysis and notions of continuity in coq. Log. Methods Comput. Sci. 17(2) (2019). https:\/\/doi.org\/10.23638\/LMCS-17(2:16)2021","DOI":"10.23638\/LMCS-17(2:16)2021"},{"key":"10269_CR3","doi-asserted-by":"crossref","unstructured":"Berger, U., Franklin, J.N., Manea, F., Pauly, A.: Revolutions and Revelations in Computability: 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11\u201315, 2022, Proceedings, vol. 13359. Springer, (2022)","DOI":"10.1007\/978-3-031-08740-0"},{"issue":"1","key":"10269_CR4","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. Am. Math. Soc. 21(1), 1\u201346 (1989)","journal-title":"Bull. Am. Math. Soc."},{"key":"10269_CR5","volume-title":"Computational Geometry","author":"MI Shamos","year":"1978","unstructured":"Shamos, M.I.: Computational Geometry. Yale University, New Haven, CT (1978)"},{"key":"10269_CR6","doi-asserted-by":"publisher","unstructured":"Calvert, W., Kramer, K., Miller, R.: Noncomputable functions in the blum-shub-smale model. Logical Methods in Computer Science 7(2) (2011). https:\/\/doi.org\/10.2168\/LMCS-7(2:15)2011","DOI":"10.2168\/LMCS-7(2:15)2011"},{"key":"10269_CR7","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1017\/S0962492900002774","volume":"6","author":"S Smale","year":"1997","unstructured":"Smale, S.: Complexity theory and numerical analysis. Acta Numer 6, 523\u2013551 (1997). https:\/\/doi.org\/10.1017\/S0962492900002774","journal-title":"Acta Numer"},{"key":"10269_CR8","doi-asserted-by":"publisher","unstructured":"Kawamura, A., Cook, S.: Complexity theory for operators in analysis. ACM Trans. Comput. Theory 4(2) (2012). https:\/\/doi.org\/10.1145\/2189778.2189780","DOI":"10.1145\/2189778.2189780"},{"key":"10269_CR9","doi-asserted-by":"publisher","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing. STOC \u201983, pp. 80\u201386. Association for Computing Machinery, New York, NY, USA (1983). https:\/\/doi.org\/10.1145\/800061.808735","DOI":"10.1145\/800061.808735"},{"key":"10269_CR10","doi-asserted-by":"publisher","unstructured":"Xie, J., Hunt III, H. B.: On the undecidability and descriptional complexity of synchronized regular expressions. Acta Informatica 60(3), 257\u2013278 (2023). https:\/\/doi.org\/10.1007\/s00236-023-00439-3","DOI":"10.1007\/s00236-023-00439-3"},{"key":"10269_CR11","doi-asserted-by":"publisher","unstructured":"Xie, J., Hunt III, H. B., Stearns, R.E.: On the computational and descriptional complexity of multi-pattern languages. Theoret. Comput. Sci. 1030, 115063 (2025). https:\/\/doi.org\/10.1016\/j.tcs.2025.115063","DOI":"10.1016\/j.tcs.2025.115063"},{"key":"10269_CR12","doi-asserted-by":"publisher","unstructured":"Xie, J., Hunt III, H. B., Stearns, R.E.: Pumping lemmas can be \u201charmful\u201d. Theory of Computing Systems. (2024). https:\/\/doi.org\/10.1007\/s00224-024-10169-9","DOI":"10.1007\/s00224-024-10169-9"},{"issue":"4","key":"10269_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.2307\/2271358","volume":"33","author":"D Richardson","year":"1968","unstructured":"Richardson, D.: Some undecidable problems involving elementary functions of a real variable. J. Symb. Log. 33(4), 514\u2013520 (1968). https:\/\/doi.org\/10.2307\/2271358","journal-title":"J. Symb. Log."},{"issue":"2","key":"10269_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/321574.321591","volume":"17","author":"BF Caviness","year":"1970","unstructured":"Caviness, B.F.: On canonical forms and simplification. J. ACM 17(2), 385\u2013396 (1970). https:\/\/doi.org\/10.1145\/321574.321591","journal-title":"J. ACM"},{"key":"10269_CR15","doi-asserted-by":"publisher","unstructured":"Xie, J., Hunt III, H. B., Stearns, R.E.: On productiveness and complexity in computable analysis through rice-style theorems for real functions. Mathematics 12(20) (2024). https:\/\/doi.org\/10.3390\/math12203248","DOI":"10.3390\/math12203248"},{"key":"10269_CR16","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA (1979)"},{"key":"10269_CR17","unstructured":"Rogers Jr, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MA, USA (1987)"},{"key":"10269_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin, Heidelberg (1987)"},{"key":"10269_CR19","volume-title":"Principles of Real Analysis","author":"CD Aliprantia","year":"1998","unstructured":"Aliprantia, C.D., Burkinshaw, O.: Principles of Real Analysis. Academic Press, San Diego (1998)"},{"issue":"3","key":"10269_CR20","first-page":"491","volume":"9","author":"N Endou","year":"2001","unstructured":"Endou, N., Wasaki, K., Shidama, Y.: Basic properties of extended real numbers. Formalized Mathematics. 9(3), 491\u2013494 (2001)","journal-title":"Formalized Mathematics."},{"key":"10269_CR21","unstructured":"Riesz, F., Nagy, B.S.: Functional Analysis. Courier Corporation, North Chelmsford, MA. (2012)"},{"key":"10269_CR22","volume-title":"Mathematical Analysis","author":"TM Apostol","year":"1974","unstructured":"Apostol, T.M.: Mathematical Analysis. Addison-Wesley series in mathematics. Addison-Wesley, Reading, MA (1974)"},{"key":"10269_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05370-2","volume-title":"Mechanics: from Newton\u2019s Laws to Deterministic Chaos","author":"F Scheck","year":"2010","unstructured":"Scheck, F.: Mechanics: from Newton\u2019s Laws to Deterministic Chaos. Springer, Berlin, Germany (2010)"},{"key":"10269_CR24","volume-title":"Principles of Mathematical Analysis","author":"W Rudin","year":"1953","unstructured":"Rudin, W.: Principles of Mathematical Analysis. International series in pure and applied mathematics. McGraw-Hill, New York (1953)"},{"key":"10269_CR25","volume-title":"Numerical Methods","author":"G Dahlquist","year":"2003","unstructured":"Dahlquist, G., Bj\u00f6rck, \u00c5.: Numerical Methods. Courier Corporation, North Chelmsford, MA (2003)"},{"key":"10269_CR26","volume-title":"Real Analysis","author":"H Royden","year":"2010","unstructured":"Royden, H., Fitzpatrick, P.M.: Real Analysis. China Machine Press, Beijing, China (2010)"},{"key":"10269_CR27","volume-title":"Fourier Analysis: an Introduction","author":"EM Stein","year":"2011","unstructured":"Stein, E.M., Shakarchi, R.: Fourier Analysis: an Introduction, vol. 1. Princeton University Press, Princeton, NJ (2011)"},{"key":"10269_CR28","volume-title":"Hilbert\u2019s Tenth Problem","author":"YV Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.V.: Hilbert\u2019s Tenth Problem. MIT Press, Cambridge, MA, USA (1993)"},{"key":"10269_CR29","doi-asserted-by":"publisher","unstructured":"Matijasevi\u010d, J.V.: Enumerable sets are diophantine. In: Mathematical Logic In The 20th Century, pp. 269\u2013273. World Scientific, Singapore (2003). https:\/\/doi.org\/10.1142\/9789812564894_0013","DOI":"10.1142\/9789812564894_0013"},{"key":"10269_CR30","volume-title":"Nonlinear Differential Equations and Dynamical Systems","author":"F Verhulst","year":"2012","unstructured":"Verhulst, F.: Nonlinear Differential Equations and Dynamical Systems. Springer, Berlin, Germany (2012)"},{"issue":"1","key":"10269_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01691341","volume":"2","author":"S Greibach","year":"1968","unstructured":"Greibach, S.: A note on undecidable properties of formal languages. Math. Syst. Theory. 2(1), 1\u20136 (1968). https:\/\/doi.org\/10.1007\/BF01691341","journal-title":"Math. Syst. Theory."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10269-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10269-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10269-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:50:40Z","timestamp":1773773440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10269-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10269"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10269-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"27 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We (Jingnan Xie, Ching-Sheng Lin, Harry B. Hunt, III, and Richard E. Stearns) certify that we have NO affiliations with or involvement in any organization or entity with any financial interest, or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"15"}}