{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:15:41Z","timestamp":1767626141437,"version":"3.40.3"},"publisher-location":"Cham","reference-count":71,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147876"},{"type":"electronic","value":"9783031147883"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14788-3_5","type":"book-chapter","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T14:24:42Z","timestamp":1660141482000},"page":"62-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computer Science for\u00a0Continuous Data"],"prefix":"10.1007","author":[{"given":"Franz","family":"Brau\u00dfe","sequence":"first","affiliation":[]},{"given":"Pieter","family":"Collins","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39053-1_1","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"K Ambos-Spies","year":"2013","unstructured":"Ambos-Spies, K., Brandt, U., Ziegler, M.: Real benefit of promises and advice. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 1\u201311. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_1"},{"issue":"1\u20133","key":"5_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2006.10.005","volume":"370","author":"J Avigad","year":"2007","unstructured":"Avigad, J., Yin, Y.: Quantifier elimination for the reals with a predicate for the powers of two. Theor. Comput. Sci. 370(1\u20133), 48\u201359 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2006.10.005","journal-title":"Theor. Comput. Sci."},{"key":"5_CR3","unstructured":"Bauer, A.: Clerical. https:\/\/github.com\/andrejbauer\/clerical (2017)"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10817-014-9317-x","volume":"54","author":"S Boldo","year":"2015","unstructured":"Boldo, S., Jourdan, J.H., Leroy, X., Melquiond, G.: Verified compilation of floating-point computations. J. Autom. Reason. 54(2), 135\u2013163 (2015)","journal-title":"J. Autom. Reason."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bornemann, F., Laurie, D., Wagon, S., Waldvogel, J.: The SIAM 100-Digit Challenge. SIAM (2004). http:\/\/www.siam.org\/books\/100digitchallenge\/","DOI":"10.1137\/1.9780898717969"},{"key":"5_CR6","doi-asserted-by":"crossref","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, pp. 63\u201372. World Scientific Publishing, Singapore (2003), iCWLC 2000, Kyoto, Japan, March 14\u201318 (2000)","DOI":"10.1142\/9789812704979_0005"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1006\/jcom.1998.0488","volume":"14","author":"V Brattka","year":"1998","unstructured":"Brattka, V., Hertling, P.: Feasible real random access machines. J. Complex. 14(4), 490\u2013526 (1998)","journal-title":"J. Complex."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Brattka, V., Pauly, A.: Computation with advice. In: Zheng, X., Zhong, N. (eds.) CCA 2010, Proceedings of the Seventh International Conference on Computability and Complexity in Analysis. Electronic Proceedings in Theoretical Computer Science, vol. 24, pp. 41\u201355 (2010)","DOI":"10.4204\/EPTCS.24.9"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/11538363_32","volume-title":"Computer Science Logic","author":"V Brattka","year":"2005","unstructured":"Brattka, V., Schr\u00f6der, M.: Computing with sequences, weak topologies and the axiom of choice. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 462\u2013476. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11538363_32"},{"key":"5_CR10","unstructured":"Brau\u00dfe, F., et al.: Semantics, logic, and verification of \u201cexact real computation\". Tech. rep., arXiv (2021)"},{"issue":"3","key":"5_CR11","first-page":"318","volume":"53","author":"M Braverman","year":"2006","unstructured":"Braverman, M., Cook, S.A.: Computing over the reals: foundations for scientific computing. Notice AMS 53(3), 318\u2013329 (2006)","journal-title":"Notice AMS"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Cho, J., Park, S., Ziegler, M.: Computing periods $${\\ldots }$$. In: Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, 3\u20135 March 2018, pp. 132\u2013143 (2018). https:\/\/doi.org\/10.1007\/978-3-319-75172-6_12","DOI":"10.1007\/978-3-319-75172-6_12"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"SA Cook","year":"1978","unstructured":"Cook, S.A.: Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7(1), 70\u201390 (1978). https:\/\/doi.org\/10.1137\/0207005","journal-title":"SIAM J. Comput."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Dries, L.v.d.: The field of reals with a predicate for the powers of two. Manus. Math.54, 187\u2013196 (1986), http:\/\/eudml.org\/doc\/155108","DOI":"10.1007\/BF01171706"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"ME Dyer","year":"1991","unstructured":"Dyer, M.E., Frieze, A.M., Kannan, R.: A random polynomial time algorithm for approximating the volume of convex bodies. J. ACM 38(1), 1\u201317 (1991). https:\/\/doi.org\/10.1145\/102782.102783","journal-title":"J. ACM"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-319-32859-1_42","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"H F\u00e9r\u00e9e","year":"2016","unstructured":"F\u00e9r\u00e9e, H., Ziegler, M.: On the computational complexity of positive linear functionals on $$\\cal{C}[0;1]$$. In: Kotsireas, I.S., Rump, S.M., Yap, C.K. (eds.) MACIS 2015. LNCS, vol. 9582, pp. 489\u2013504. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32859-1_42"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0001-8708(84)90019-7","volume":"53","author":"H Friedman","year":"1984","unstructured":"Friedman, H.: The computational complexity of maximization and integration. Adv. Math. 53, 80\u201398 (1984). https:\/\/doi.org\/10.1016\/0001-8708(84)90019-7","journal-title":"Adv. Math."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00276875","volume":"89","author":"Y Giga","year":"1985","unstructured":"Giga, Y., Miyakawa, T.: Solutions in $$l^r$$ of the Navier-stokes initial value problem. Arch. Ration. Mech. Anal. 89(3), 267\u2013281 (1985)","journal-title":"Arch. Ration. Mech. Anal."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11685654_12","volume-title":"Theoretical Computer Science","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O.: On promise problems: a survey. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, pp. 254\u2013290. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11685654_12"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1006\/jcom.1996.0021","volume":"12","author":"P Hertling","year":"1996","unstructured":"Hertling, P.: Topological complexity with continuous operations. J. Complex. 12, 315\u2013338 (1996). https:\/\/doi.org\/10.1006\/jcom.1996.0021","journal-title":"J. Complex."},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/malq.200310124","volume":"51","author":"P Hertling","year":"2005","unstructured":"Hertling, P.: Is the Mandelbrot set computable? Math. Log. Q. 51(1), 5\u201318 (2005)","journal-title":"Math. Log. Q."},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Hertling, P., Spandl, C.: Computing a solution of Feigenbaum\u2019s functional equation in polynomial time. Log. Methods Comput. Sci. 10(4), 4:7, 9 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(4:7)2014","DOI":"10.2168\/LMCS-10(4:7)2014"},{"key":"5_CR23","volume-title":"Library for double-double and quad-double arithmetic","author":"Y Hida","year":"2007","unstructured":"Hida, Y., Li, X.S., Bailey, D.H.: Library for double-double and quad-double arithmetic. Tech. rep, Lawrence Berkeley National Laboratory (2007)"},{"key":"5_CR24","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-59234-9_7","volume-title":"Handbook of Computability and Complexity in Analysis","author":"M Hoyrup","year":"2021","unstructured":"Hoyrup, M., Rute, J.: Computable measure theory and algorithmic randomness. In: Handbook of Computability and Complexity in Analysis. TAC, pp. 227\u2013270. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_7"},{"key":"5_CR25","unstructured":"Jiman, H.: Real computation: from computability via efficiency to practice. M.sc. thesis, School of Computing (2021)"},{"key":"5_CR26","unstructured":"Kanada, Y.J.: \n\n                \n              \n. Math. Cult. 1(1), 72\u201383 (2003). Calculation of circumferential ratio by computer"},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00037-010-0286-0","volume":"19","author":"A Kawamura","year":"2010","unstructured":"Kawamura, A.: Lipschitz continuous ordinary differential equations are polynomial-space complete. Comput. Complex. 19(2), 305\u2013332 (2010). https:\/\/doi.org\/10.1007\/s00037-010-0286-0","journal-title":"Comput. Complex."},{"issue":"5","key":"5_CR28","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jco.2015.05.001","volume":"31","author":"A Kawamura","year":"2015","unstructured":"Kawamura, A., M\u00fcller, N., R\u00f6snick, C., Ziegler, M.: Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey\u2019s hierarchy. J. Complex. 31(5), 689\u2013714 (2015). https:\/\/doi.org\/10.1016\/j.jco.2015.05.001","journal-title":"J. Complex."},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-40189-8_15","volume-title":"Pursuit of the Universal","author":"A Kawamura","year":"2016","unstructured":"Kawamura, A., Steinberg, F., Ziegler, M.: Towards computational complexity theory on advanced function spaces in analysis. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 142\u2013152. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40189-8_15"},{"issue":"8","key":"5_CR30","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1017\/S096012951600013X","volume":"27","author":"A Kawamura","year":"2017","unstructured":"Kawamura, A., Steinberg, F., Ziegler, M.: On the computational complexity of the Dirichlet problem for Poisson\u2019s equation. Math. Struct. Comput. Sci. 27(8), 1437\u20131465 (2017). https:\/\/doi.org\/10.1017\/S096012951600013X","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0022-0000(82)90053-8","volume":"24","author":"KI Ko","year":"1982","unstructured":"Ko, K.I.: The maximum value problem and NP real numbers. J. Comput. Syst. Sci. 24, 15\u201335 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complex. Theory Real Funct","author":"KI Ko","year":"1991","unstructured":"Ko, K.I.: Complex. Theory Real Funct. Progress in Theoretical Computer Science, Birkh\u00e4user, Boston (1991)"},{"key":"5_CR33","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, 323\u2013352 (1982)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1002\/malq.200610039","volume":"180","author":"PK K\u00f8ber","year":"2007","unstructured":"K\u00f8ber, P.K.: Uniform domain representations of $$\\ell _p$$-spaces. Math. Log. Q. 180(2), 180\u2013205 (2007)","journal-title":"Math. Log. Q."},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-79416-3_13","volume-title":"Computer Science \u2013 Theory and Applications","author":"I Koswara","year":"2021","unstructured":"Koswara, I., Pogudin, G., Selivanova, S., Ziegler, M.: Bit-complexity of solving systems of linear evolutionary partial differential equations. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 223\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_13"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Kreisel, G., Macintyre, A.: Constructive logic versus algebraization, I. In: Troelstra, A., van Dalen, D. (eds.) The L. E. J. Brouwer Centenary Sympos. Studies in Logic and the Foundations of Mathematics, vol. 110, pp. 217\u2013260. North-Holland, Amsterdam (1982), (Noordwijkerhout, June 8\u201313 1981)","DOI":"10.1016\/S0049-237X(09)70130-2"},{"key":"5_CR37","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","volume":"38","author":"C Kreitz","year":"1985","unstructured":"Kreitz, C., Weihrauch, K.: Theory of representations. Theoret. Comput. Sci. 38, 35\u201353 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1017\/S0960129506005822","volume":"17","author":"B Lambov","year":"2007","unstructured":"Lambov, B.: RealLib: an efficient implementation of exact real arithmetic. Math. Struct. Comput. Sci. 17, 81\u201398 (2007)","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Le Roux, S., Ziegler, M.: Singular coverings and non-uniform notions of closed set computability. In: Dillhage, R., Grubba, T., Sorbi, A., Weihrauch, K., Zhong, N. (eds.) Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007). Electronic Notes in Theoretical Computer Science, vol. 202, pp. 73\u201388. Elsevier (2008), CCA 2007, Siena, Italy, 6\u201318 June 2007","DOI":"10.1016\/j.entcs.2008.03.009"},{"key":"5_CR40","unstructured":"Lee, H.: Random sampling of continuous objects. Ph.D. thesis, School of Computing (2020)"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Lim, D., Ziegler, M.: Quantitative coding and complexity theory of continuous data. Tech. rep., arXiv (2021)","DOI":"10.1007\/978-3-030-51466-2_18"},{"issue":"3","key":"5_CR42","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(77)90048-2","volume":"5","author":"H Luckhardt","year":"1977","unstructured":"Luckhardt, H.: A fundamental effect in computations on real numbers. Theoret. Comput. Sci. 5(3), 321\u2013324 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-20028-6_27","volume-title":"Evolving Computability","author":"TH McNicholl","year":"2015","unstructured":"McNicholl, T.H.: A note on the computable categoricity of $$\\ell ^p$$ spaces. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 268\u2013275. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20028-6_27"},{"key":"5_CR44","doi-asserted-by":"publisher","unstructured":"Mori, T., Tsujii, Y., Yasugi, M.: Computability of probability distributions and characteristic functions. Log. Methods Comput. Sci. 9, 3:9, 11 (2013). https:\/\/doi.org\/10.2168\/LMCS-9(3:9)2013","DOI":"10.2168\/LMCS-9(3:9)2013"},{"key":"5_CR45","doi-asserted-by":"publisher","first-page":"37","DOI":"10.4064\/fm-44-1-37-51","volume":"44","author":"A Mostowski","year":"1957","unstructured":"Mostowski, A.: On computable sequences. Fundam. Math. 44, 37\u201351 (1957)","journal-title":"Fundam. Math."},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45335-0_14","volume-title":"Computability and Complexity in Analysis","author":"NT M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.T.: The iRRAM: exact arithmetic in C++. In: Blanck, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 222\u2013252. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45335-0_14"},{"key":"5_CR47","doi-asserted-by":"publisher","unstructured":"Nakao, M.T., Plum, M., Watanabe, Y.: Numerical Verification Methods and Computer-Assisted Proofs for Partial Differential Equations. Springer Series in Computational Mathematics, Springer (2019). https:\/\/doi.org\/10.1007\/978-981-13-7669-6","DOI":"10.1007\/978-981-13-7669-6"},{"key":"5_CR48","doi-asserted-by":"publisher","unstructured":"Neumann, E., Ouaknine, J., Worrell, J.: On ranking function synthesis and termination for polynomial programs. In: Konnov, I., Kov\u00e1cs, L. (eds.) 31st International Conference on Concurrency Theory, CONCUR 2020, September 1\u20134, 2020, Vienna, Austria (Virtual Conference). LIPIcs, vol. 171, pp. 15:1\u201315:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.15","DOI":"10.4230\/LIPIcs.CONCUR.2020.15"},{"key":"5_CR49","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"5_CR50","unstructured":"Park, S., Ziegler, M.: Reliable degenerate matrix diagonalization. Tech. Rep. CS-TR-2018-415, KAIST (2018)"},{"key":"5_CR51","doi-asserted-by":"publisher","unstructured":"Pauly, A., Seon, D., Ziegler, M.: Computing Haar measures. In: Fern\u00e1ndez, M., Muscholl, A. (eds.) 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13\u201316, 2020, Barcelona, Spain. LIPIcs, vol. 152, pp. 34:1\u201334:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.34","DOI":"10.4230\/LIPIcs.CSL.2020.34"},{"issue":"7","key":"5_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4115\/jla.2013.5.7","volume":"5","author":"A Pauly","year":"2013","unstructured":"Pauly, A., Ziegler, M.: Relative computability and uniform continuity of relations. J. Log. Anal. 5(7), 1\u201339 (2013)","journal-title":"J. Log. Anal."},{"key":"5_CR53","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0001-8708(81)90001-3","volume":"39","author":"MB Pour-El","year":"1981","unstructured":"Pour-El, M.B., Richards, J.I.: The wave equation with computable initial data such that its unique solution is not computable. Advances in Math. 39, 215\u2013239 (1981)","journal-title":"Advances in Math."},{"issue":"6","key":"5_CR54","first-page":"896","volume":"14","author":"R Rettinger","year":"2008","unstructured":"Rettinger, R.: Bloch\u2019s constant is computable. J. Univ. Comput. Sci. 14(6), 896\u2013907 (2008)","journal-title":"J. Univ. Comput. Sci."},{"issue":"3","key":"5_CR55","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/MS.2018.110113408","volume":"36","author":"S Ryu","year":"2019","unstructured":"Ryu, S., Park, J., Park, J.: Toward analysis and bug finding in javascript web applications in the wild. IEEE Softw. 36(3), 74\u201382 (2019). https:\/\/doi.org\/10.1109\/MS.2018.110113408","journal-title":"IEEE Softw."},{"key":"5_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/11780342_48","volume-title":"Logical Approaches to Computational Barriers","author":"M Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, M.: Admissible representations in computable analysis. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 471\u2013480. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780342_48"},{"key":"5_CR57","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-030-59234-9_9","volume-title":"Handbook of Computability and Complexity in Analysis","author":"M Schr\u00f6der","year":"2021","unstructured":"Schr\u00f6der, M.: Admissibly Represented Spaces and Qcb-Spaces. In: Handbook of Computability and Complexity in Analysis. TAC, pp. 305\u2013346. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_9"},{"key":"5_CR58","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":"5_CR59","first-page":"321","volume-title":"Constructive Aspects of the Fundamental Theorem of Algebra","author":"E Specker","year":"1969","unstructured":"Specker, E.: The fundamental theorem of algebra in recursive analysis. In: Dejon, B., Henrici, P. (eds.) Constructive Aspects of the Fundamental Theorem of Algebra, pp. 321\u2013329. Wiley-Interscience, London (1969)"},{"key":"5_CR60","doi-asserted-by":"publisher","unstructured":"Steinberg, F.: Complexity theory for spaces of integrable functions. Logical Methods in Computer Science 13(3), Paper No. 21, 39 (2017). https:\/\/doi.org\/10.23638\/LMCS-13(3:21)2017","DOI":"10.23638\/LMCS-13(3:21)2017"},{"key":"5_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-030-41672-0_7","volume-title":"Complexity and Approximation","author":"S-M Sun","year":"2020","unstructured":"Sun, S.-M., Zhong, N., Ziegler, M.: Computability of the solutions to Navier-Stokes equations via effective approximation. In: Du, D.-Z., Wang, J. (eds.) Complexity and Approximation. LNCS, vol. 12000, pp. 80\u2013112. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41672-0_7"},{"key":"5_CR62","doi-asserted-by":"publisher","unstructured":"Triebel, H.: Theory of Function Spaces I, II, III. Birkh\u00e4user (1983, 1992, 2006). https:\/\/doi.org\/10.1007\/978-3-0346-0416-1","DOI":"10.1007\/978-3-0346-0416-1"},{"key":"5_CR63","doi-asserted-by":"publisher","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9","DOI":"10.1007\/978-3-642-56999-9"},{"issue":"6","key":"5_CR64","first-page":"801","volume":"14","author":"K Weihrauch","year":"2008","unstructured":"Weihrauch, K.: The computable multi-functions on multi-represented sets are closed under programming. J. Univ. Comput. Sci. 14(6), 801\u2013844 (2008)","journal-title":"J. Univ. Comput. Sci."},{"key":"5_CR65","doi-asserted-by":"publisher","unstructured":"Weihrauch, K., Tavana-Roshandel, N.: Representations of measurable sets in computable measure theory. Logical Methods Comput. Sci. 10, 3:7,21 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(3:7)2014","DOI":"10.2168\/LMCS-10(3:7)2014"},{"issue":"2","key":"5_CR66","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1112\/S0024611502013643","volume":"85","author":"K Weihrauch","year":"2002","unstructured":"Weihrauch, K., Zhong, N.: Is wave propagation computable or can wave computers beat the Turing machine? Proc. Lond. Math. Soc. 85(2), 312\u2013332 (2002)","journal-title":"Proc. Lond. Math. Soc."},{"key":"5_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-642-39053-1_51","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"C Yap","year":"2013","unstructured":"Yap, C., Sagraloff, M., Sharma, V.: Analytic root clustering: a complete algorithm using soft zero tests. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 434\u2013444. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_51"},{"key":"5_CR68","doi-asserted-by":"crossref","unstructured":"Yap, C.K.: On guaranteed accuracy computation. In: Geometric Computation, pp. 322\u2013373. World Scientific Publishing, Singapore (2004)","DOI":"10.1142\/9789812794833_0012"},{"key":"5_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15582-6_24","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"J Yu","year":"2010","unstructured":"Yu, J., Yap, C., Du, Z., Pion, S., Br\u00f6nnimann, H.: The design of Core 2: a library for exact numeric computation in geometry and algebra. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 121\u2013141. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15582-6_24"},{"issue":"8","key":"5_CR70","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1016\/j.apal.2011.12.030","volume":"163","author":"M Ziegler","year":"2012","unstructured":"Ziegler, M.: Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra. Ann. Pure Appl. Logic 163(8), 1108\u20131139 (2012). https:\/\/doi.org\/10.1016\/j.apal.2011.12.030","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20133","key":"5_CR71","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2004.06.022","volume":"326","author":"M Ziegler","year":"2004","unstructured":"Ziegler, M., Brattka, V.: Computability in linear algebra. Theoret. Comput. Sci. 326(1\u20133), 187\u2013211 (2004)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14788-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:15:13Z","timestamp":1660259713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14788-3_5"}},"subtitle":["Survey, Vision, Theory, and Practice of a Computer \n\n            \n          \n Analysis System"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147876","9783031147883"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14788-3_5","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":"11 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","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":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}