{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:10:33Z","timestamp":1761581433597},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_5","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T15:34:07Z","timestamp":1465832047000},"page":"45-57","source":"Crossref","is-referenced-by-count":5,"title":["Computability and Analysis, a Historical Approach"],"prefix":"10.1007","author":[{"given":"Vasco","family":"Brattka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1090\/S0002-9939-1971-0302982-7","volume":"30","author":"O Aberth","year":"1971","unstructured":"Aberth, O.: The failure in computable analysis of a classical existence theorem for differential equations. Proc. Am. Math. Soc. 30, 151\u2013156 (1971)","journal-title":"Proc. Am. Math. Soc."},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/CBO9781107338579.002","volume-title":"Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic, LNL","author":"J Avigad","year":"2014","unstructured":"Avigad, J., Brattka, V.: Computability and analysis: the legacy of Alan Turing. In: Downey, R. (ed.) Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic, LNL, vol. 42, pp. 1\u201347. Cambridge University Press, Cambridge, UK (2014)"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02007567","volume":"25","author":"G Baigger","year":"1985","unstructured":"Baigger, G.: Die Nichtkonstruktivit\u00e4t des Brouwerschen Fixpunktsatzes. Arch. Math. Logic 25, 183\u2013188 (1985)","journal-title":"Arch. Math. Logic"},{"key":"5_CR4","series-title":"A Series of Modern Surveys in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-68952-9","volume-title":"Foundations of Constructive Mathematics","author":"MJ Beeson","year":"1985","unstructured":"Beeson, M.J.: Foundations of Constructive Mathematics. A Series of Modern Surveys in Mathematics. Springer, Berlin (1985)"},{"issue":"2","key":"5_CR5","first-page":"159","volume":"8","author":"\u00c9 Borel","year":"1912","unstructured":"Borel, \u00c9.: Le calcul des int\u00e9gral d\u00e9finies. Journal de Mathematiques pures et appliqu\u00e9es 8(2), 159\u2013210 (1912)","journal-title":"Journal de Mathematiques pures et appliqu\u00e9es"},{"key":"5_CR6","unstructured":"Borel, \u00c9.: La th\u00e9orie de la mesure et al th\u00e9orie de l\u2019integration. In: Le\u00e7ons sur la th\u00e9orie des fonctions, pp. 214\u2013256. Gauthier-Villars, Paris, 4 edn. (1950)"},{"key":"5_CR7","unstructured":"Brattka, V.: Computability of Banach space principles. Informatik Berichte 286, FernUniversit\u00e4t Hagen, Fachbereich Informatik, Hagen, June 2001"},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/malq.200310125","volume":"51","author":"V Brattka","year":"2005","unstructured":"Brattka, V.: Effective Borel measurability and reducibility of functions. Math. Logic Q. 51(1), 19\u201344 (2005)","journal-title":"Math. Logic Q."},{"key":"5_CR9","series-title":"LNL","first-page":"130","volume-title":"Logic Colloquium 2002","author":"V Brattka","year":"2006","unstructured":"Brattka, V.: Computable versions of the uniform boundedness theorem. In: Chatzidakis, Z., et al. (eds.) Logic Colloquium 2002. LNL, vol. 27, pp. 130\u2013151. ASL, Urbana (2006)"},{"issue":"7\u20138","key":"5_CR10","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s00153-007-0057-z","volume":"46","author":"V Brattka","year":"2008","unstructured":"Brattka, V.: Borel complexity and computability of the Hahn-Banach Theorem. Arch. Math. Logic 46(7\u20138), 547\u2013564 (2008)","journal-title":"Arch. Math. Logic"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.apal.2008.09.002","volume":"157","author":"V Brattka","year":"2009","unstructured":"Brattka, V.: A computable version of Banach\u2019s inverse mapping theorem. Ann. Pure Appl. Logic 157, 85\u201396 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1016\/j.apal.2011.12.020","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., de Brecht, M., Pauly, A.: Closed choice and a uniform low basis theorem. Ann. Pure Appl. Logic 163, 986\u20131008 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"5_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2178\/bsl\/1294186663","volume":"17","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bull. Symbolic Logic 17(1), 73\u2013117 (2011)","journal-title":"Bull. Symbolic Logic"},{"issue":"1","key":"5_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.2178\/jsl\/1294170993","volume":"76","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. J. Symbolic Logic 76(1), 143\u2013176 (2011)","journal-title":"J. Symbolic Logic"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.ic.2015.03.005","volume":"242","author":"V Brattka","year":"2015","unstructured":"Brattka, V., Gherardi, G., H\u00f6lzl, R.: Probabilistic computability and choice. Inf. Comput. 242, 249\u2013286 (2015)","journal-title":"Inf. Comput."},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.apal.2011.10.006","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., Gherardi, G., Marcone, A.: The Bolzano-Weierstrass theorem is the jump of weak K\u0151nig\u2019s lemma. Ann. Pure Appl. Logic 163, 623\u2013655 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-0-387-68546-5_18","volume-title":"New Computational Paradigms: Changing Conceptions of What is Computable","author":"V Brattka","year":"2008","unstructured":"Brattka, V., Hertling, P., Weihrauch, K.: A tutorial on computable analysis. In: Cooper, S.B., et al. (eds.) New Computational Paradigms: Changing Conceptions of What is Computable, pp. 425\u2013491. Springer, New York (2008)"},{"key":"5_CR18","unstructured":"Brattka, V., Le Roux, S., Pauly, A.: Connected choice and the Brouwer fixed point theorem. arXiv 1206.4809. http:\/\/arxiv.org\/abs\/1206.4809"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0304-3975(02)00693-X","volume":"305","author":"V Brattka","year":"2003","unstructured":"Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theor. Comput. Sci. 305, 43\u201376 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"5_CR20","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1016\/j.jco.2006.04.007","volume":"22","author":"V Brattka","year":"2006","unstructured":"Brattka, V., Yoshikawa, A.: Towards computability of elliptic boundary value problems in variational formulation. J. Complex. 22(6), 858\u2013880 (2006)","journal-title":"J. Complex."},{"issue":"4","key":"5_CR21","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1215\/00294527-2009-018","volume":"50","author":"G Gherardi","year":"2009","unstructured":"Gherardi, G., Marcone, A.: How incomputable is the separable Hahn-Banach theorem? Notre Dame Journal of Formal Logic 50(4), 393\u2013425 (2009)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","volume":"42","author":"A Grzegorczyk","year":"1955","unstructured":"Grzegorczyk, A.: Computable functionals. Fundamenta Mathematicae 42, 168\u2013202 (1955)","journal-title":"Fundamenta Mathematicae"},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0304-3975(98)00290-4","volume":"219","author":"P Hertling","year":"1999","unstructured":"Hertling, P.: An effective Riemann mapping theorem. Theor. Comput. Sci. 219, 225\u2013265 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/COM-2012-005","volume":"1","author":"M Hoyrup","year":"2012","unstructured":"Hoyrup, M., Rojas, C., Weihrauch, K.: Computability of the Radon-Nikodym derivative. Computability 1(1), 3\u201313 (2012)","journal-title":"Computability"},{"key":"5_CR25","first-page":"33","volume":"173","author":"CG Jockusch","year":"1972","unstructured":"Jockusch, C.G., Soare, R.I.: $$\\Pi ^{0}_{1}$$ \u03a0 1 0 classes and degrees of theories. Trans. Am. Math. Soc. 173, 33\u201356 (1972)","journal-title":"Trans. Am. Math. Soc."},{"key":"5_CR26","unstructured":"Kleene, S.C.: Recursive functions and intuitionistic mathematics. In: Proceedings of the International Congress of Mathematicians, Cambridge, 1950, vol. 1, pp. 679\u2013685. AMS, Providence (1952)"},{"key":"5_CR27","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"KI Ko","year":"1991","unstructured":"Ko, K.I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1991)"},{"key":"5_CR28","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2307\/2267457","volume":"17","author":"G Kreisel","year":"1952","unstructured":"Kreisel, G.: On the interpretation of non-finitist proofs, II: interpretation of number theory, applications. J. Symbolic Logic 17, 43\u201358 (1952)","journal-title":"J. Symbolic Logic"},{"key":"5_CR29","unstructured":"Lacombe, D.: Remarques sur les op\u00e9rateurs r\u00e9cursifs et sur les fonctions r\u00e9cursives d\u2019une variable r\u00e9elle. C. R. Acad. Paris 241, 1250\u20131252, th\u00e9orie des fonctions, November 1955"},{"key":"5_CR30","unstructured":"Lacombe, D.: Les ensembles r\u00e9cursivement ouverts ou ferm\u00e9s, et leurs applications \u00e0 l\u2019Analyse r\u00e9cursive. C. R. Acad. Paris 245, 1040\u20131043, logique (1957)"},{"issue":"5","key":"5_CR31","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/malq.200610058","volume":"54","author":"S Roux Le","year":"2008","unstructured":"Le Roux, S., Ziegler, M.: Singular coverings and non-uniform notions of closed set computability. Math. Logic Q. 54(5), 545\u2013560 (2008)","journal-title":"Math. Logic Q."},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Metakides, G., Nerode, A.: The introduction of non-recursive methods into mathematics. In: Troelstra, A., van Dalen, D. (eds.) The L.E.J. Brouwer Centenary Symposium, pp. 319\u2013335. North-Holland, Amsterdam (1982)","DOI":"10.1016\/S0049-237X(09)70135-1"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Metakides, G., Nerode, A., Shore, R.A.: Recursive limits on the Hahn-Banach theorem. In: Rosenblatt, M. (ed.) Errett Bishop: Reflections on Him and His Research. AMS, Providence (1985). Contemp. Math. vol. 39, pp. 85\u201391","DOI":"10.1090\/conm\/039\/08"},{"key":"5_CR34","first-page":"55","volume":"152","author":"VP Orevkov","year":"1963","unstructured":"Orevkov, V.P.: A constructive mapping of the square onto itself displacing every constructive point (Russian). Doklady Akademii Nauk 152, 55\u201358 (1963). Translated in: Soviet Math. - Dokl. vol. 4, pp. 1253\u20131256 (1963)","journal-title":"Doklady Akademii Nauk"},{"issue":"18","key":"5_CR35","first-page":"2686","volume":"16","author":"A Pauly","year":"2010","unstructured":"Pauly, A.: How incomputable is finding Nash equilibria? J. Univers. Comput. Sci. 16(18), 2686\u20132710 (2010)","journal-title":"J. Univers. Comput. Sci."},{"issue":"5","key":"5_CR36","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1002\/malq.200910104","volume":"56","author":"A Pauly","year":"2010","unstructured":"Pauly, A.: On the (semi)lattices induced by continuous reducibilities. Math. Logic Q. 56(5), 488\u2013502 (2010)","journal-title":"Math. Logic Q."},{"key":"5_CR37","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0003-4843(79)90021-4","volume":"17","author":"MB Pour-El","year":"1979","unstructured":"Pour-El, M.B., Richards, J.I.: A computable ordinary differential equation which possesses no computable solution. Ann. Math. Logic 17, 61\u201390 (1979)","journal-title":"Ann. Math. Logic"},{"key":"5_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"MB Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1989)"},{"key":"5_CR39","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","volume":"5","author":"HG Rice","year":"1954","unstructured":"Rice, H.G.: Recursive real numbers. Proc. Am. Math. Soc. 5, 784\u2013791 (1954)","journal-title":"Proc. Am. Math. Soc."},{"key":"5_CR40","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"SG Simpson","year":"2009","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press, Poughkeepsie (2009)","edition":"2"},{"issue":"3","key":"5_CR41","doi-asserted-by":"crossref","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E Specker","year":"1949","unstructured":"Specker, E.: Nicht konstruktiv beweisbare S\u00e4tze der Analysis. J. Symbolic Logic 14(3), 145\u2013158 (1949)","journal-title":"J. Symbolic Logic"},{"key":"5_CR42","first-page":"254","volume-title":"Constructivity in Mathematics","author":"E Specker","year":"1959","unstructured":"Specker, E.: Der Satz vom Maximum in der rekursiven Analysis. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 254\u2013265. North-Holland, Amsterdam (1959)"},{"issue":"2","key":"5_CR43","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"AM Turing","year":"1937","unstructured":"Turing, A.M.: On computable numbers, with an application to the \u201cEntscheidungsproblem\u201d. Proc. London Math. Soc. 42(2), 230\u2013265 (1937)","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"5_CR44","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1112\/plms\/s2-43.6.544","volume":"43","author":"AM Turing","year":"1938","unstructured":"Turing, A.M.: On computable numbers, with an application to the \u201cEntscheidungsproblem\u201d. Correction Proc. London Math. Soc. 43(2), 544\u2013546 (1938)","journal-title":"Correction Proc. London Math. Soc."},{"key":"5_CR45","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"},{"issue":"4","key":"5_CR46","first-page":"209","volume":"10","author":"ID Zaslavski\u012d","year":"1955","unstructured":"Zaslavski\u012d, I.D.: Disproof of some theorems of classical analysis in constructive analysis (Russian). Usp. Mat. Nauk 10(4), 209\u2013210 (1955)","journal-title":"Usp. Mat. Nauk"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T05:28:57Z","timestamp":1600752537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}