Aberth, Oliver, Analysis in the Computable Number Field, Journal of the Association for Computing Machinery15 (1968) 275-299
Aberth, Oliver, A Chain of Inclusion Relations in Computable Analysis, Proceedings of the American Mathematical Society22 (1969) 539-548
Aberth, Oliver, Computable analysis and differential equations, in: Kino, A. and Myhill, J. and Vesley, R.E. (eds.), Intuitionism and Proof Theory, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1970, pages 47-52
Aberth, Oliver, The failure in computable analysis of a classical existence theorem for differential equations, Proceedings of the American Mathematical Society30 (1971) 151-156
Aberth, Oliver, Computable Analysis, McGraw-Hill, New York, 1980
Ackerman, Nathanael L. and Freer, Cameron E. and Roy, Daniel M., Noncomputable conditional distributions, in: 26th Annual IEEE Symposium on Logic in Computer Science–LICS 2011, IEEE Computer Soc., Los Alamitos, CA, 2011, pages 107-116
Ackerman, Nathanael L. and Freer, Cameron E. and Roy, Daniel M., On computability and disintegration, Mathematical Structures in Computer Science27:8 (2017) 1287-1314
Akama, Yohji and Iizuka, Shinji, Real number representations of graph-directed IFS attractors, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 3-24
Alaev, P. E. and Selivanov, V. L., Fields of algebraic numbers computable in polynomial time. II, Algebra and Logic60:6 (2021) 349-359
Alaev, Pavel and Selivanov, Victor, Complexity issues for the iterated h-preorders, in: Descriptional complexity of formal systems, vol. 13037 of Lecture Notes in Comput. Sci., Springer, Cham, 2021, pages 1-12
Ambaram, Tânia and Beggs, Edwin and Costa, José Félix and Poças, Diogo and Tucker, John V, An analogue-digital model of computation: Turing machines with physical oracles, in: Advances in Unconventional Computing, Springer, 2017, pages 73-115
Ambos-Spies, Klaus and Weihrauch, Klaus and Zheng, Xizhong, Weakly Computable Real Numbers, Journal of Complexity16:4 (2000) 676-690
Ambos-Spies, Klaus and Zheng, Xizhong, On the Differences and Sums of Strongly Computably Enumerable Real Numbers, in: Manea, Florin and Martin, Barnaby and Paulusma, Daniël and Primiero, Giuseppe (eds.), Computing with Foresight and Industry, vol. 11558 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 310-322
Amir, Djamel Eddine and Hoyrup, Mathieu, Computability of Finite Simplicial Complexes, in: Bojańczyk, Mikołaj and Merelli, Emanuela and Woodruff, David P. (eds.), 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), vol. 229 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, pages 111:1-111:16
Andreev, Valentin V. and McNicholl, Timothy H., Computable Complex Analysis, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 101-140
Apsītis, Kalvis and Arikawa, Setsuo and Freivalds, Rūsiņš and Hirowatari, Eiju and Smith, Carl H., On the inductive inference of recursive real-valued functions, Theoretical Computer Science219 (1999) 3-17
Arend Heyting, Intuitionism: An Introduction, 3rd ed., North-Holland, 1971
Ariza-Ruiz, David and Martol Briseid, Eyvind and Jiménez-Melado, Antonio and López-Acedo, Genaro, Rate of convergence under weak contractiveness conditions, Fixed Point Theory14:1 (2013) 11-27
Avigad, Jeremy, Weak theories of nonstandard arithmetic and analysis, in: Simpson, Stephen (ed.), Reverse Mathematics 2001, Lecture Notes in Logic, Association for Symbolic Logic, La Jolla, 2005, pages 19-46
Avigad, Jeremy and Brattka, Vasco, Computability and analysis: the legacy of Alan Turing, in: Downey, Rod (ed.), Turing's Legacy: Developments from Turing's Ideas in Logic, vol. 42 of Lecture Notes in Logic, Cambridge University Press, Cambridge, UK, 2014, pages 1-47
Avigad, Jeremy and Gerhardy, Philipp and Towsner, Henry, Local stability of ergodic averages, Transactions of the American Mathematical Society362 (2010) 261-288
Avigad, Jeremy and Simic, Ksenija, Fundamental notions of analysis in subsystems of second-order arithmetic, Annals of Pure and Applied Logic139 (2006) 138-184
Badaev, Serikzhan and Spreen, Dieter, A note on partial numberings, Mathematical Logic Quarterly51:2 (2005) 129-136
Baez, J.C., Recursivity in quantum mechanics, Transactions of the American Mathematical Society280 (1983) 339-350
Baigger, Günter, Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes, Archive for Mathematical Logic25 (1985) 183-188
Baire, R., Sur les fonctions des variables reeles, Annali di matematica pura ed applicata3 (1899) 1-123
Banach, Stefan and Mazur, Stanisław, Sur les fonctions calculables, Annales de la Société Polonaise de Mathématique16 (1937) 219
Barmpalias, George, On 0'-computable Reals, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Barmpalias, George, A transfinite hierarchy of reals, Mathematical Logic Quarterly49:2 (2003) 163-172
Barmpalias, George, The approximation structure of a computably approximable real, The Journal of Symbolic Logic68:3 (2003) 885-922
Barmpalias, George, Approximation representations for reals and their wtt-degrees, Mathematical Logic Quarterly50:4,5 (2004) 370-380
Barmpalias, George, Approximation representations for Δ_2 reals, Archive for Mathematical Logic43:8 (2004) 947-964
Barmpalias, George, Aspects of Chaitin's Omega, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 175-205
Barmpalias, George and Brodhead, Paul and Cenzer, Douglas and Dashti, Seyyed and Weber, Rebecca, Algorithmic Randomness of Closed Sets, Journal of Logic and Computation17:6 (2007) 1041-1062
Barmpalias, George and Brodhead, Paul and Cenzer, Douglas and Remmel, Jeffrey B. and Weber, Rebecca, Algorithmic randomness of continuous functions, Archive for Mathematical Logic46:7-8 (2008) 533-546
Barmpalias, George and Cenzer, Douglas and Remmel, Jeffrey B. and Weber, Rebecca, K-Trivial Closed Sets and Continuous Functions, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 135-145
Barmpalias, George and Lewis-Pye, Andrew, A Note on the Differences of Computably Enumerable Reals, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 623-632
Barmpalias, George and Montalbán, Antonio, A cappable almost everywhere dominating computably enumerable degree, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 17-31
Barmpalias, Georgios, Computability and Applications to Analysis, PhD thesis, University of Leeds, School of Mathematics, Leeds, 2004
Baroni, M. A. and Bridges, D. S., Continuity Properties of Preference Relations, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 19-25
Baroni, Marian Alexandru, Constructive Suprema, Journal of Universal Computer Science11:12 (2005) 1865-1877
Baroni, Marian Alexandru, Towards a good constructive definition of order completeness, in: Proceedings of the Sixth Congress of Romanian Mathematicians. Vol. 1, Ed. Acad. Române, Bucharest, 2009, pages 547-550
Barrett, Jordan Mitchell and Downey, Rodney G. and Greenberg, Noam, Cousin's lemma in second-order arithmetic, Proceedings of the American Mathematical Society. Series B9 (2022) 111-124
Batra, Prashant, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 201-218
Battenfeld, Ingo and Schröder, Matthias and Simpson, Alex, Compactly generated domain theory, Mathematical Structures in Computer Science16:2 (2006) 141-161
Battenfeld, Ingo and Schröder, Matthias and Simpson, Alex, A Convenient Category of Domains, Electronic Notes in Theoretical Computer Science172 (2007) 69-99
Bauer, Andrej, The Realizability Approach to Computable Analysis and Topology, PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, 2000
Bauer, Andrej, A Relationship between Equilogical Spaces and Type Two Effectivity, in: Brooks, Stephen and Mislove, Michael (eds.), Seventeenth Conference on the Mathematical Foundations of Programming Semantics, vol. 45 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2001
Bauer, Andrej, A Relationship between Equilogical Spaces and Type Two Effectivity, Mathematical Logic Quarterly48:Suppl. 1 (2002) 1-15
Bauer, Andrej and Birkedal, Lars and Scott, Dana S., Equilogical spaces, Theoretical Computer Science315 (2004) 35-59
Bauer, Andrej and Escardó, Martín Hötzel and Simpson, Alex, Comparing Functional Paradigms for Exact Real-Number Computation, in: Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy, Matthew and Eidenbenz, Stephan and Conejo, Ricardo (eds.), Automata, Languages and Programming, vol. 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 488-500
Bauer, Andrej and Kavkler, Iztok, Implementing real numbers with RZ, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 365-384
Bauer, Andrej and Simpson, Alex, Locally non-compact spaces and continuity principles, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 103-116
Bauer, Andrej and Simpson, Alex, Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability, Mathematical Logic Quarterly50:4,5 (2004) 351-369
Bauer, Andrej and Swan, Andrew, Every metric space is separable in function realizability, Logical Methods in Computer Science15:2 (2019) Paper No. 14, 7
Bauer, Andrej and Taylor, Paul, The Dedekind reals in abstract Stone duality, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 25-64
Bazhenov, Nikolay and Fiori-Carones, Marta and Liu, Lu and Melnikov, Alexander, Primitive recursive reverse mathematics, Annals of Pure and Applied Logic175:1, Part A (2024) 103354
Bazhenov, Nikolay and Harrison-Trainor, Matthew and Melnikov, Alexander, Computable Stone spaces, Annals of Pure and Applied Logic174:9 (2023) 103304
Becher, Verónica, Turing's normal numbers: towards randomness, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 35-45
Becher, Verónica and Daicz, Sergio and Chaitin, Gregory, A highly random number, in: Combinatorics, computability and logic (Constanţa, 2001), Springer Ser. Discrete Math. Theor. Comput. Sci., Springer, London, 2001, pages 55-68
Becher, Verónica and Grigorieff, Serge, Recursion and topology on 2^≤ω for possibly infinite computations, Theoretical Computer Science322:1 (2004) 85-136
Becher, Verónica and Grigorieff, Serge, Random reals á la Chaitin with or without prefix-freeness, Theoretical Computer Science385 (2007) 193-201
Bedregal, Benjamín René Callejas and Acióly, Benedito Melo, Effectively Given Continuous Domains: A Computable Interval Analysis, Electronic Journal on Mathematics of Computation0 (1999)
Beeson, M.J., Problematic principles in constructive mathematics, in: Logic Colloquium '80, vol. 108 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1980, pages 11-55
Beeson, Michael, Constructivity, Computability, and the Continuum, in: Sica, Giandomenico (eds.), Essays on the Foundations of Mathematics and Logic, vol. 2 of Advanced Studies in Mathematics and Logic, Polimetrica, Milano, 2005, pages 9-37
Beeson, Michael J., Foundations of Constructive Mathematics, A Series of Modern Surveys in Mathematics, Springer, Berlin, 1985
Benci, V. and Bonanno, C. and Galatolo, S. and Menconi, G. and Virgilio, M., Dynamical systems and computable information, Discrete and Continuous Dynamical Systems B4:4 (2004) 935-960
Berger, Josef, The fan theorem and uniform continuity, in: Cooper, S. Barry and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, 2005, pages 18-22
Berger, Josef, Constructive Equivalents of the Uniform Continuity Theorem, Journal of Universal Computer Science11:12 (2005) 1878-1883
Berger, Josef, The logical strength of the uniform continuity theorem, in: Beckmann, Arnold and Berger, Ulrich and Löwe, Benedikt and Tucker, John V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, 2006, pages 35-39
Berger, Josef, The Logical Strength of the Uniform Continuity Theorem, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 35-39
Berger, Josef, Weak König's lemma implies the fan theorem for c-bars, in: Computation and Logic in the Real World, 2007, pages 86-88
Berger, Josef and Bridges, Douglas S., The fan theorem and positive-valued uniformly continuous functions on compact intervals, New Zealand Journal of Mathematics38 (2008) 129-135
Berger, Josef and Bridges, Douglas S., A constructive study of Landau's summability theorem, J.UCS16:18 (2010) 2523-2534
Berger, Josef and Bridges, Douglas S. and Schuster, Peter, The fan theorem and unique existence of maxima, The Journal of Symbolic Logic71:2 (2006) 713-720
Berger, Josef and Ishihara, Hajime and Palmgren, Erik and Schuster, Peter, A predicative completion of a uniform space, Annals of Pure and Applied Logic163:8 (2012) 975-980
Berger, Josef and Ishihara, Hajime and Schuster, Peter, The weak Kőnig lemma, Brouwer's Fan theorem, de Morgan's law, and dependent choice, Reports on Mathematical Logic :47 (2012) 63-86
Berger, Josef and Schuster, Peter, Classifying Dini's Theorem, Notre Dame Journal of Formal Logic47:2 (2006) 253-262
Berger, Ulrich and Miyamoto, Kenji and Schwichtenberg, Helmut and Tsuiki, Hideki, Logic for Gray-code computation, in: Concepts of proof in mathematics, philosophy, and computer science, vol. 6 of Ontos Math. Log., De Gruyter, Berlin, 2016, pages 69-110
Berger, Ulrich and Spreen, Dieter, A coinductive approach to computing with compact sets, Journal of Logic and Analysis8 (2016) Paper No. 3, 35
Bienvenu, Laurent and Day, Adam and Mezhirov, Ilya and Shen, Alexander, Ergodic-type Characterizations of Algorithmic Randomness, in: Fernando Ferreira and Benedikt Löwe and Elvira Mayordomo and Luís Mendes Gomes (eds.), CiE 2010, vol. 6158 of Lecture Notes in Computer Science, Springer, Berlin, 2010, pages 49-58
Bienvenu, Laurent and Hölzl, Rupert and Miller, Joseph S. and Nies, André, The Denjoy alternative for computable functions, in: 29th International Symposium on Theoretical Aspects of Computer Science, vol. 14 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2012, pages 543-554
Bienvenu, Laurent and Hölzl, Rupert and Miller, Joseph S. and Nies, André, Denjoy, Demuth and density, J. Math. Log.14:1 (2014) 1450004, 35
Bienvenu, Laurent and Kuyper, Rutger, Parallel and serial jumps of Weak Weak König's Lemma, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 201-217
Bienvenu, Laurent and Merkle, Wolfgang, Effective randomness for computable probability measures, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 117-130
Binder, Ilia and Braverman, Mark, The complexity of simulating Brownian motion, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 2009, pages 58-67
Binder, Ilia and Braverman, Mark, The Complexity of Simulating Brownian Motion, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '09, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2009, pages 58-67
Binder, Ilia and Braverman, Mark and Rojas, Cristobal and Yampolsky, Michael, Computability of Brolin-Lyubich measure, Comm. Math. Phys.308:3 (2011) 743-771
Binder, Ilia and Glucksam, Adi and Rojas, Cristobal and Yampolsky, Michael, Computability in harmonic analysis, Foundations of Computational Mathematics22:3 (2022) 849-873
Bishop, E. and Cheng, H., Constructive Measure Theory, American Mathematical Society, Providence, 1972
Bishop, Errett, Constructive Methods in the Theory of Banach Algebras, in: Birtel, F.T. (ed.), Function Algebras, Scott-Foresman, Chicago, 1966, pages 343-345
Bishop, Errett, Foundations of Constructive Analysis, McGraw-Hill, New York, 1967
Bishop, Errett, A constructive ergodic theorem, J. Math. Mech.17 (1967/1968) 631-639
Bishop, Errett, The constructivization of abstract mathematical analysis, Izdat. Mir (1968) 308-313
Bishop, Errett, Mathematics as a numerical language, in: Kino, A. and Myhill, J. and Vesley, R.E. (eds.), Intuitionism and Proof Theory (Proc. Conf., Buffalo, N.Y., 1968), vol. 60 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1970, pages 53-71
Bishop, Errett and Bridges, Douglas S., Constructive Analysis, vol. 279 of Grundlehren der Mathematischen Wissenschaften, Springer, Berlin, 1985
Blanck, Jens, Domain representability of metric spaces, Annals of Pure and Applied Logic83 (1997) 225-247
Blanck, Jens, Computability on topological spaces by effective domain representations, PhD thesis, Uppsala University, Department of Mathematics, Uppsala, Sweden, 1997
Blanck, Jens, Effective domain representations of H(X), the space of compact subsets, Theoretical Computer Science219 (1999) 19-48
Blanck, Jens, Effectivity of Regular Spaces, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 1-15
Blanck, Jens, Exact Real Arithmetic Systems: Results of Competition, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 389-393
Blanck, Jens, Efficient exact computation of iterated maps, The Journal of Logic and Algebraic Programming64 (2005) 41-59
Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001
Blanck, Jens and Stoltenberg-Hansen, Viggo and Tucker, John V., Domain representations of partial functions, with applications to spatial objects and constructive volume geometry, Theoretical Computer Science284:2 (2002) 207-240
Blanck, Jens and Stoltenberg-Hansen, Viggo and Tucker, John V., Stability for Effective Algebras, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 3-15
Bläser, Markus, Uniform computational complexity of the derivatives of C^∞-functions, Theoretical Computer Science284:2 (2002) 199-206
Boehm, Hans and Cartwright, Robert, Exact real arithmetic, formulating real numbers as functions, in: Turner, D. (ed.), Research topics in functional programming, Addison-Wesley, 1990, pages 43-64
Boehm, Hans-J., The constructive reals as a Java library, The Journal of Logic and Algebraic Programming64 (2005) 3-11
Boldi, Paolo and Vigna, Sebastiano, δ-uniform BSS Machines, Journal of Complexity14:2 (1998) 234-256
Boldi, Paolo and Vigna, Sebastiano, Equality is a Jump, Theoretical Computer Science219 (1999) 49-64
Bonanno, Claudio and Galatolo, Stefano and Isola, Stefano, Recurrence and algorithmic information, Nonlinearity17:3 (2004) 1057-1074
Bonnot, Sylvain and Braverman, Mark and Yampolsky, Michael, Thurston equivalence to a rational map is decidable, Mosc. Math. J.12:4 (2012) 747-763, 884
Borel, Émil, Le calcul des intégral définies, Journal de Mathematiques pures et appliquées8:2 (1912) 159-210
Borel, Émil, Euvres de Émil Borel Vol. 1-4, Éditions du CNRS, Paris, 1972
Borel, Émile, La théorie de la mesure et al théorie de l'integration, in: Leçons sur la théorie des fonctions, Gauthier-Villars, Paris, 1950, pages 214-256
Bosserhoff, Volker, Computability of solutions of operator equations, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 179-202
Bosserhoff, Volker, On the Effective Existence of Schauder Bases (Extended Abstract), in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 17-21
Bosserhoff, Volker, Notions of Probabilistic Computability on Represented Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 137-170
Bournez, Olivier, Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk), in: Paul, Christophe and Bläser, Markus (eds.), 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), vol. 154 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pages 3:1-3:13
Bournez, Olivier and Dershowitz, Nachum and Néron, Pierre, Axiomatizing Analog Algorithms, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 215-224
Bournez, Olivier and Durand, Arnaud, Recursion schemes, discrete differential equations and characterization of polynomial time computations, in: 44th International Symposium on Mathematical Foundations of Computer Science, vol. 138 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2019, page Art. No. 23, 14
Bournez, Olivier and Graça, Daniel S. and Pouly, Amaury, On the complexity of solving initial value problems, in: van der Hoeven, Joris and van Hoeij, Mark (eds.), ISSAC 2012–Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2012, pages 115-121
Bournez, Olivier and Graça, Daniel S. and Pouly, Amaury, Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations, in: Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide (eds.), 43rd International Colloquium on Automata, Languages, and Programming, vol. 55 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Dagstuhl, Germany, 2016, page Art. No. 109, 15
Bournez, Olivier and Graça, Daniel S. and Pouly, Amaury, Rigorous numerical computation of polynomial differential equations over unbounded domains, in: Kotsireas, Ilias S. and Rump, Siegfried M. and Yap, Chee K. (eds.), Mathematical aspects of computer and information sciences, vol. 9582 of Lecture Notes in Computer Science, Springer, Cham, 2016, pages 469-473
Bournez, Olivier and Graça, Daniel S. and Hainry, Emmanuel, Robust computations with dynamical systems, in: Mathematical foundations of computer science 2010, vol. 6281 of Lecture Notes in Comput. Sci., Springer, Berlin, 2010, pages 198-208
Bournez, Olivier and Hainry, Emmanuel, Elementarily computable functions over the real numbers and R-sub-recursive functions, Theoretical Computer Science348 (2005) 130-147
Bournez, Olivier and Pouly, Amaury, A universal ordinary differential equation, in: Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca (eds.), 44th International Colloquium on Automata, Languages, and Programming, vol. 80 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Dagstuhl, Germany, 2017, page Art. No. 116, 14
Bournez, Olivier and Pouly, Amaury, A Survey on Analog Models of Computation, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 173-226
Brady, S.S. and Remmel, J.B., The undecidability of the lattice of r.e. closed subsets of an effective topological space, Annals of Pure and Applied Logic35 (1987) 193-203
Brattka, Vasco, Computable selection in analysis, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 125-138
Brattka, Vasco, A Stability Theorem for Recursive Analysis, in: Cristian S. Calude and Michael J. Dinneen (eds.), Combinatorics, Computation & Logic, Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1999, pages 144-158
Brattka, Vasco, Realistic models of computability on the real numbers, in: Yoshikawa, Atsushi (ed.), Relevance and Feasibility of Mathematical Analysis on the Computer, vol. 1169 of Sūrikaisekikenkyūsho Kōkyūroku, Research Institute for Mathematical Sciences, Kyoto, 2000, pages 62-75
Brattka, Vasco, Computable versions of Baire's category theorem, in: Sgall, Jiří and Pultr, Aleš and Kolman, Petr (eds.), Mathematical Foundations of Computer Science 2001, vol. 2136 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 224-235
Brattka, Vasco, Computing Uniform Bounds, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Brattka, Vasco, Random Numbers and an Incomplete Immune Recursive Set, in: Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy, Matthew and Eidenbenz, Stephan and Conejo, Ricardo (eds.), Automata, Languages and Programming, vol. 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 950-961
Brattka, Vasco, Computability over Topological Structures, in: Cooper, S. Barry and Goncharov, Sergey S. (eds.), Computability and Models, Kluwer Academic Publishers, New York, 2003, pages 93-136
Brattka, Vasco, Du 13-ième problème de Hilbert à la théorie des réseaux de neurones : aspects constructifs du théorème de superposition de Kolmogorov, in: Charpentier, Éric and Lesne, Annick and Nikolski, Nikolaï (eds.), L'héritage de Kolmogorov en mathématiques, Éditions Belin, Paris, 2004, pages 241-268
Brattka, Vasco, On the Borel Complexity of Hahn-Banach Extensions, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 3-16
Brattka, Vasco, Computability on Non-Separable Banach Spaces and Landau's Theorem, in: Crosilla, Laura and Schuster, Peter (eds.), From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics, Oxford University Press, 2005, pages 316-333
Brattka, Vasco, Computable Versions of the Uniform Boundedness Theorem, in: Chatzidakis, Z. and Koepke, P. and Pohlers, W. (eds.), Logic Colloquium 2002, vol. 27 of Lecture Notes in Logic, Association for Symbolic Logic, Urbana, 2006, pages 130-151
Brattka, Vasco, From Hilbert's 13th Problem to the theory of neural networks: constructive aspects of Kolmogorov's Superposition Theorem, in: Charpentier, Éric and Lesne, Annick and Nikolski, Nikolaï (eds.), Kolmogorov's Heritage in Mathematics, Springer, Berlin, 2007, pages 253-280
Brattka, Vasco, Computability and Analysis, a Historical Approach, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 45-57
Brattka, Vasco, On the complexity of learning programs, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 166-177
Brattka, Vasco and Collins, Pieter and Rettinger, Robert (eds.), Computability and Complexity in Analysis, Selected Papers of the Fifth International Conference on Computability and Complexity in Analysis, August 21-24, 2008, Hagen, Germany, vol. 15 of Journal of Universal Computer Science, Graz University of Technology, Graz, 2009
Brattka, Vasco and Diener, Hannes and Spreen, Dieter (eds.), Logic, Computation, Hierarchies, vol. 4 of Ontos Mathematical Logic, Walter de Gruyter, Boston, 2014
Brattka, Vasco and Dillhage, Ruth, On Computable Compact Operators on Banach Spaces, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 365-386
Brattka, Vasco and Frougny, Christiane and Müller, Norbert (eds.), Real Numbers, Selected Papers of the 6th conference on Real Numbers and Computers, Dagstuhl, Germany, November 15-17, 2004, vol. 41 of Theoretical Informatics and Applications, EDP Sciences, Les Ulis, 2007
Brattka, Vasco and Gherardi, Guido, Borel Complexity of Topological Operations on Computable Metric Spaces, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 83-97
Brattka, Vasco and Gherardi, Guido, Weihrauch Degrees, Omniscience Principles and Weak Computability, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 83-94
Brattka, Vasco and Gherardi, Guido, Effective Choice and Boundedness Principles in Computable Analysis, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 95-106
Brattka, Vasco and Gherardi, Guido, Weihrauch Goes Brouwerian, The Journal of Symbolic Logic85:4 (2020) 1614-1653
Brattka, Vasco and Gherardi, Guido, Completion of Choice, Annals of Pure and Applied Logic172:3 (2021) 102914
Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert and Pauly, Arno, The Vitali Covering Theorem in the Weihrauch Lattice, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 188-200
Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert, Las Vegas Computability and Algorithmic Randomness, in: Mayr, Ernst W. and Ollinger, Nicolas (eds.), 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), vol. 30 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015, pages 130-142
Brattka, Vasco and Gherardi, Guido and Pauly, Arno, Weihrauch Complexity in Computable Analysis, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 367-417
Brattka, Vasco and Hertling, Peter and Ko, Ker-I and Tsuiki, Hideki (eds.), Computability and Complexity in Analysis, Selected Papers of the International Conference CCA 2005, held in Kyoto, Japan, August 25-29, 2005, vol. 522 of Journal of Complexity, Elsevier, Amsterdam, 2006
Brattka, Vasco and Hertling, Peter and Ko, Ker-I and Zhong, Ning (eds.), Special Issue Computability and Complexity in Analysis, Selected Papers of the International Conference CCA 2003, held in Cincinnati, Ohio, August 28-30, 2003, vol. 50 of Mathematical Logic Quarterly, Wiley-VCH, Weinheim, 2004
Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus, A Tutorial on Computable Analysis, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), New Computational Paradigms: Changing Conceptions of What Is Computable, Springer, New York, 2008, pages 425-491
Brattka, Vasco and Hölzl, Rupert and Kuyper, Rutger, Monte Carlo Computability, in: Vollmer, Heribert and Vallée, Brigitte (eds.), 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), vol. 66 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017, pages 17:1-17:14
Brattka, Vasco and Ishihara, Hajime and Schröder, Matthias and Zhong, Ning (eds.), Computability and Complexity in Analysis, Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy, vol. 14 of Journal of Universal Computer Science, Graz University of Technology, Graz, 2008
Brattka, Vasco and Ishihara, Hajime and Schröder, Matthias and Zhong, Ning (eds.), Computability and Complexity in Analysis, Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy, vol. 54 of Mathematical Logic Quarterly, Wiley-VCH, Weinheim, 2008
Brattka, Vasco and Kalantari, Iraj, A Bibliography of Recursive Analysis and Recursive Topology, in: Ershov, Yu. L. and Goncharov, S.S. and Nerode, A. and Remmel, J.B. (eds.), Handbook of Recursive Mathematics, vol. 138 of Studies in Logic and the Foundations of Mathematics, Elsevier, Amsterdam, 1998, pages 583-620
Brattka, Vasco and Le Roux, Stéphane and Miller, Joseph S. and Pauly, Arno, The Brouwer Fixed Point Theorem Revisited, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 58-67
Brattka, Vasco and Le Roux, Stéphane and Pauly, Arno, On the Computational Content of the Brouwer Fixed Point Theorem, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Berlin, 2012, pages 57-67
Brattka, Vasco and Miller, Joseph S. and Nies, André, Randomness and Differentiability, Transactions of the American Mathematical Society368:1 (2016) 581-605
Brattka, Vasco and Pauly, Arno, Computation with Advice, in: Zheng, Xizhong and Zhong, Ning (eds.), CCA 2010, Proceedings of the Seventh International Conference on Computability and Complexity in Analysis, vol. 24 of Electronic Proceedings in Theoretical Computer Science, 2010, pages 41-55
Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002, vol. 66(1) of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005
Brattka, Vasco and Ziegler, Martin, Computability of linear equations, in: Baeza-Yates, Ricardo and Montanari, Ugo and Santoro, Nicola (eds.), Foundations of Information Technology in the Era of Network and Mobile Computing, vol. 223 of IFIP International Federation for Information Processing, Kluwer Academic Publishers, Dordrecht, 2002, pages 95-106
Brauße, Franz and Collins, Pieter and Ziegler, Martin, Computer Science for Continuous Data, in: Boulier, François and England, Matthew and Sadykov, Timur M. and Vorozhtsov, Evgenii V. (eds.), Computer Algebra in Scientific Computing, Springer, Cham, 2022, pages 62-82
Brauße, Franz and Korovina, Margarita and Müller, Norbert, Using Taylor models in exact real arithmetic, in: Kotsireas, Ilias S. and Rump, Siegfried M. and Yap, Chee K. (eds.), Mathematical aspects of computer and information sciences, vol. 9582 of Lecture Notes in Computer Science, Springer, Cham, 2016, pages 474-488
Braverman, M. and Yampolsky, M., Non-computable Julia sets, Journal of the American Mathematical Society19:3 (2006) 551-578
Braverman, Mark, Hyperbolic Julia Sets are Poly-Time Computable, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 17-30
Braverman, Mark, On the Complexity of Real Functions, in: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS '05, IEEE Computer Society, Washington, DC, USA, 2005, pages 155-164
Braverman, Mark, Parabolic Julia sets are polynomial time computable, Nonlinearity19:6 (2006) 1383-1401
Braverman, Mark, Computability and Complexity of Julia Sets, PhD thesis, University of Toronto, Toronto, Canada, 2008
Braverman, Mark and Cook, Stephen A., Computing over the Reals: Foundations for Scientific Computing, Notices of the AMS53:3 (2006) 318-329
Braverman, Mark and Grigo, Alexander and Rojas, Cristobal, Noise vs Computational Intractability in Dynamics, in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS '12, ACM, New York, NY, USA, 2012, pages 128-141
Braverman, Mark and Schneider, Jonathan and Rojas, Cristóbal, Space-bounded Church-Turing thesis and computational tractability of closed systems, Physical review letters115:9 (2015) 098701
Braverman, Mark and Yampolsky, Michael, Constructing non-computable Julia sets, in: STOC'07–Proceedings of the 39th Annual ACM Symposium on Theory of Computing, ACM, New York, 2007, pages 709-716
Braverman, Mark and Yampolsky, Michael, Computability of Julia Sets, vol. 23 of Algorithms and Computation in Mathematics, Springer, Berlin, 2008
Braverman, Mark and Yampolsky, Michael, Computability of Julia sets, Moscow Mathematical Journal8:2 (2008) 185-231, 399
Brecht, Matthew de and Pauly, Arno and Schröder, Matthias, Overt choice, Computability9:3-4 (2020) 169-191
Breutzmann, Josef M. and Juedes, David W. and Lutz, Jack H., Baire Category and Nowhere Differentiability for Feasible Real Functions, in: Eades, Peter and Takaoka, Tadao (eds.), Algorithms and Computation, vol. 2223 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 219-230
Breutzmann, Josef M. and Juedes, David W. and Lutz, Jack H., Baire category and nowhere differentiability for feasible real functions, Mathematical Logic Quarterly50:4,5 (2004) 460-472
Bridges, D. S., More on the connectivity of convex sets, Proceedings of the American Mathematical Society68:2 (1978) 214-216
Bridges, D. S. and Calude, C. and Pavlov, B. and Ştefănescu, D., The constructive implicit function theorem and applications in mechanics, Chaos, Solitons and Fractals10:6 (1999) 927-934
Bridges, D. S. and Dudley Ward, N. F., Constructing ultraweakly continuous functionals on B(H), Proceedings of the American Mathematical Society126:11 (1998) 3347-3353
Bridges, D. S. and McKubre-Jordens, M., Solving the Dirichlet problem constructively, J. Log. Anal.5 (2013) Paper 3, 22
Bridges, D. S. and Richman, F. and Julian, W. H. and Mines, R., Extensions and fixed points of contractive maps in R^n, Journal of Mathematical Analysis and Applications165:2 (1992) 438-456
Bridges, D. S. and Vîţă, L. S., A constructive theory of apartness on lattices, Scientiae Mathematicae Japonicae69:2 (2009) 187-206
Bridges, D.S. and Julian, W.H. and Richman, F. and Mines, R., Extensions and fixed points of contractive maps in R^n, J. Math. Anal. Appl.165 (1992) 438-456
Bridges, D.S. and Mines, R., What is constructive mathematics?, The Mathematical Intelligencer6:4 (1984) 32-38
Bridges, Douglas S., Some notes on continuity in constructive analysis, Bull. London Math. Soc.8:2 (1976) 179-182
Bridges, Douglas S., A constructive look at orthonormal bases in Hilbert space, Amer. Math. Monthly84:3 (1977) 189-191
Bridges, Douglas S., The constructive Radon-Nikodým theorem, Pacific J. Math.70:1 (1977) 51-65
Bridges, Douglas S., A note on Morse's lambda-notation in set theory, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik24:2 (1978) 113-114
Bridges, Douglas S., On weak operator compactness of the unit ball of L(H), Zeitschrift für Mathematische Logik und Grundlagen der Mathematik24:6 (1978) 493-494
Bridges, Douglas S., On the connectivity of convex sets, The Bulletin of the London Mathematical Society10:1 (1978) 86-90
Bridges, Douglas S., On continuous mappings between locally compact metric spaces, The Bulletin of the London Mathematical Society10:2 (1978) 201-208
Bridges, Douglas S., Constructive Functional Analysis, Pitman, London, 1979
Bridges, Douglas S., Connectivity properties of metric spaces, Pacific Journal of Mathematics80:2 (1979) 325-331
Bridges, Douglas S., On the constructive convergence of series of independent functions, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik25:1 (1979) 93-96
Bridges, Douglas S., A criterion for compactness in metric spaces?, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik25:2 (1979) 97-98
Bridges, Douglas S., Geometric intuition and elementary constructive analysis, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik25:6 (1979) 521-523
Bridges, Douglas S., On the foundations of best-approximation theory, Journal of Approximation Theory28:3 (1980) 273-292
Bridges, Douglas S., A constructive development of Chebyshev approximation theory, Journal of Approximation Theory30:2 (1980) 99-120
Bridges, Douglas S., Towards a constructive foundation for quantum mechanics, in: Richman, F. (ed.), Constructive Mathematics, vol. 873 of Lecture Notes in Mathematics, 1981, pages 260-273
Bridges, Douglas S., A constructive look at positive linear functionals on L(H), Pacific Journal of Mathematics95:1 (1981) 11-25
Bridges, Douglas S., On the isolation of zeroes of an analytic function, Pacific Journal of Mathematics96:1 (1981) 13-22
Bridges, Douglas S., Correction to: "On the isolation of zeroes of an analytic function" [Pacific J. Math. 96 (1981), no. 1, 13-22; MR 82k:03095], Pacific Journal of Mathematics97:2 (1981) 487-488
Bridges, Douglas S., A constructive analysis of the Remes algorithm, Journal of Approximation Theory32:4 (1981) 257-270
Bridges, Douglas S., A constructive proximinality property of finite-dimensional linear subspaces, The Rocky Mountain Journal of Mathematics11:4 (1981) 491-497
Bridges, Douglas S., On Montel's proof of the great Picard theorem, The American Mathematical Monthly88:1 (1981) 45-47
Bridges, Douglas S., Preference and utility: a constructive development, Journal of Mathematical Economics9:1-2 (1982) 165-185
Bridges, Douglas S., Lipschitz constants and moduli of continuity for the Chebyshev projection, Proceedings of the American Mathematical Society85:4 (1982) 557-561
Bridges, Douglas S., Recent progress in constructive approximation theory, in: The L. E. J. Brouwer Centenary Symposium (Noordwijkerhout, 1981), North-Holland, Amsterdam, 1982, pages 41-50
Bridges, Douglas S., Numerical representation of intransitive preferences on a countable set, Journal of Economic Theory30:1 (1983) 213-217
Bridges, Douglas S., A numerical representation of preferences with intransitive indifference, Journal of Mathematical Economics11:1 (1983) 25-42
Bridges, Douglas S., Representing interval orders by a single real-valued function, Journal of Economic Theory36:1 (1985) 149-155
Bridges, Douglas S., Operator ranges, integrable sets, and the functional calculus, Houston Journal of Mathematics11:1 (1985) 31-44
Bridges, Douglas S., Numerical representation of interval orders on a topological space, Journal of Economic Theory38:1 (1986) 160-166
Bridges, Douglas S., A constructive Morse theory of sets, in: Mathematical logic and its applications (Druzhba, 1986), Plenum, New York, 1987, pages 61-79
Bridges, Douglas S., Locatedness, convexity, and Lebesque measurability, Quart. J. Math. Oxford Ser. 239 (1988) 411-421
Bridges, Douglas S., The Euclidean distance construction of order homomorphisms, Mathematical Social Sciences15:2 (1988) 179-188
Bridges, Douglas S., A general constructive intermediate value theorem, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik35 (1989) 433-435
Bridges, Douglas S., The constructive theory of preference relations on a locally compact space, Indagationes Mathematicae51:2 (1989) 141-165
Bridges, Douglas S., Approximate interpolation by functions in a Haar space, Journal of Approximation Theory57:1 (1989) 35-39
Bridges, Douglas S., Preference, indifference, and Markov's principle, Mathematical Social Sciences20:2 (1990) 131-145
Bridges, Douglas S., Order isomorphisms–a constructive measure-theoretic view, in: Mathematical logic, Plenum, New York, 1990, pages 243-255
Bridges, Douglas S., The constructive inequivalence of various notions of preference ordering, Mathematical Social Sciences21:2 (1991) 169-176
Bridges, Douglas S., Sequential, pointwise, and uniform continuity: a constructive note, Mathematical Logic Quarterly39:1 (1993) 55-61
Bridges, Douglas S., Constructive notions of strict convexity, Mathematical Logic Quarterly39:3 (1993) 295-300
Bridges, Douglas S., A constructive look at the real number line, in: Real numbers, generalizations of the reals, and theories of continua, Kluwer Acad. Publ., Dordrecht, 1994, pages 29-92
Bridges, Douglas S., The constructive theory of preference relations on a locally compact space. II, Mathematical Social Sciences27:1 (1994) 1-9
Bridges, Douglas S., Constructive mathematics and unbounded operations, J. Philos. Logic24:5 (1995) 549-561
Bridges, Douglas S., Bishop's Principle, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 17-20
Bridges, Douglas S., Constructive truth in practice, in: Truth in mathematics (Mussomeli, 1995), Oxford Univ. Press, New York, 1998, pages 53-69
Bridges, Douglas S., Constructive methods in mathematical economics, in: Herden, Gerhard and Knoche, Norbert and Seidl, Christian and Trockel, Walter (eds.), Mathematical utility theory (Essen, 1997), vol. Supp. 8 of Journal of Economy, Springer, Vienna, 1999, pages 1-21
Bridges, Douglas S., Constructive mathematics: a foundation for computable analysis, Theoretical Computer Science219 (1999) 95-109
Bridges, Douglas S., Can constructive mathematics be applied in physics?, Journal of Philosophical Logic28:5 (1999) 439-453
Bridges, Douglas S., Converses of Bishop's lemma on located sets, Indagationes Mathematicae11:1 (2000) 31-38
Bridges, Douglas S., A constructive look at functions of bounded variation, Bull. London Math. Soc.32:3 (2000) 316-324
Bridges, Douglas S., Constructive methods in Banach algebra theory, Mathematica Japonica52:1 (2000) 145-161
Bridges, Douglas S., Dini's Theorem: A Constructive Case Study, in: Calude, C.S. and Dinneen, M.J. and Sburlan, S. (eds.), Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, London, 2001, pages 69-80
Bridges, Douglas S., Prime and maximal ideals in constructive ring theory, Communications in Algebra29:7 (2001) 2787-2803
Bridges, Douglas S., Reality and virtual reality in mathematics, Bulletin of the European Association for Theoretical Computer Science78 (2002) 221-230
Bridges, Douglas S., First steps in constructive game theory, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 3-9
Bridges, Douglas S., First steps in constructive game theory, Mathematical Logic Quarterly50:4,5 (2004) 501-506
Bridges, Douglas S., Constructivity in Mathematics, Cubo6:1 (2004) 209-258
Bridges, Douglas S., Constructive complements of unions of two closed sets, Mathematical Logic Quarterly50:3 (2004) 293-294
Bridges, Douglas S., Church's thesis and Bishop's constructivism, in: Olszewski, Adam (ed.), Church's Thesis After 70 Years, Ontos, Berlin, 2006, pages 58-65
Bridges, Douglas S., Colocatedness and Lebesgue Integrability, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 98-104
Bridges, Douglas S., Philosophy of mathematics: 5 questions, in: Hendricks, Vincent F. and Leitgeb, Hannes (eds.), Philosophy of mathematics: 5 questions, Automatic Press/VIP, New York, London, 2007, pages 45-49
Bridges, Douglas S., Constructing local optima on a compact interval, Archive for Mathematical Logic46 (2007) 149-154
Bridges, Douglas S., Uniform continuity properties of preference relations, Notre Dame Journal of Formal Logic49:1 (2008) 97-106
Bridges, Douglas S., Product a-frames and proximity, Mathematical Logic Quarterly54:1 (2008) 12-25
Bridges, Douglas S., Characterising weak-operator continuous linear functionals on B(H) constructively, Doc. Math.16 (2011) 597-617
Bridges, Douglas S., Constructive Solutions of Ordinary Differential Equations, in: Ulrich Berger and Hannes Diener and Peter Schuster and Monika Seisenberger (eds.), Logic, Construction, Computation, vol. 3 of Ontos Mathematical Logic, de Gruyter, 2012, pages 67-77
Bridges, Douglas S., Locating Ax, where A is a subspace of B(H), Log. Methods Comput. Sci. :The Ninth International Conference on Computability and Complexity in Analysis (CCA) 2012 (2014) 2:9, 10
Bridges, Douglas S., Tightly bordered convex and co-convex sets, Sci. Math. Jpn.77:1 (2014) 45-57
Bridges, Douglas S., Tightly bordered convex and co-convex sets, Scientiae Mathematicae Japonicae77:1 (2014) 45-57
Bridges, Douglas S., The continuum hypothesis implies excluded middle, in: Concepts of proof in mathematics, philosophy, and computer science, vol. 6 of Ontos Math. Log., De Gruyter, Berlin, 2016, pages 111-114
Bridges, Douglas S. and Calder, Allan and Julian, William and Mines, Ray and Richman, Fred, Locating metric complements in R^n, in: Richman, F. (ed.), Constructive Mathematics, vol. 873 of Lecture Notes in Mathematics, 1981, pages 241-249
Bridges, Douglas S. and Calder, Allan and Julian, William and Mines, Ray and Richman, Fred, Bounded linear mappings of finite rank, Journal of Functional Analysis43:2 (1981) 143-148
Bridges, Douglas S. and Calder, Allan and Julian, William and Mines, Ray and Richman, Fred, Picard's theorem, Transactions of the American Mathematical Society269:2 (1982) 513-520
Bridges, Douglas S. and Dediu, Luminiţa, Paradise lost, or paradise regained?, Bulletin of the European Association for Theoretical Computer Science63 (1997) 141-155
Bridges, Douglas S. and Dediu, Luminiţa, Weak continuity properties in constructive analysis, Logic Journal of the IGPL. Interest Group in Pure and Applied Logics7:3 (1999) 277-281
Bridges, Douglas S. and Dediu, Luminiţa, Weak-operator continuity and the existence of adjoints, Mathematical Logic Quarterly45:2 (1999) 203-206
Bridges, Douglas S. and Dediu, Luminiţa, The weak-operator sequential continuity of left multiplication, Indagationes Mathematicae11:1 (2000) 39-42
Bridges, Douglas S. and Demuth, Osvald, On the Lebesgue measurability of continuous functions in constructive analysis, BAMS24:2 (1991) 259-276
Bridges, Douglas S. and Dent, James and McKubre-Jordens, Maarten, Constructive connections between anti-Specker, positivity, and fan-theoretic properties, New Zealand J. Math.44 (2014) 21-33
Bridges, Douglas S. and Dent, James and McKubre-Jordens, Maarten, Z-stability in Constructive Analysis, Logical Methods in Computer Science12:3 (2016)
Bridges, Douglas S. and Havea, Robin, A constructive analysis of a proof that the numerical range is convex, London Math. Soc. Journal of Mathematics and Computation3 (2000) 191-206
Bridges, Douglas S. and Havea, Robin, A constructive version of the spectral mapping theorem, Mathematical Logic Quarterly47:3 (2001) 299-304
Bridges, Douglas S. and Havea, Robin, Powers of a Hermitian element, New Zealand J. Math.36 (2007) 1-10
Bridges, Douglas S. and Havea, Robin and Schuster, Peter, Constructive Banach algebra theory and the Nullstellensatz, Publ. Math. Debrecen69:1,2 (2006) 171-184
Bridges, Douglas S. and Havea, Robin S., Constructive notions of maximality for ideals, Journal of Universal Computer Science14:22 (2008) 3648-3657
Bridges, Douglas S. and Havea, Robin S., Constructing square roots in a Banach algebra, Scientiae Mathematicae Japonicae70:3 (2009) 355-366
Bridges, Douglas S. and Havea, Robin S., Square roots and powers in constructive Banach algebra theory, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 68-77
Bridges, Douglas S. and Hendtlass, Matthew and Palmgren, Erik, A constructive examination of rectifiability, Journal of Logic and Analysis8 (2016) Paper No. 4, 17
Bridges, Douglas S. and Ishihara, Hajime, Linear mappings are fairly well-behaved, Archiv der Mathematik54:6 (1990) 558-562
Bridges, Douglas S. and Ishihara, Hajime, Locating the range of an operator on a Hilbert space, The Bulletin of the London Mathematical Society24:6 (1992) 599-605
Bridges, Douglas S. and Ishihara, Hajime, Complements of intersections in constructive mathematics, Mathematical Logic Quarterly40:1 (1994) 35-43
Bridges, Douglas S. and Ishihara, Hajime, Absolute continuity and the uniqueness of the constructive functional calculus, Mathematical Logic Quarterly40:4 (1994) 519-527
Bridges, Douglas S. and Ishihara, Hajime, Erratum: "Complements of intersections in constructive mathematics", Mathematical Logic Quarterly40:4 (1994) 570
Bridges, Douglas S. and Ishihara, Hajime, Spectra of selfadjoint operators in constructive analysis, Indagationes Mathematicae7:1 (1996) 11-35
Bridges, Douglas S. and Ishihara, Hajime, A definite constructive open mapping theorem?, Mathematical Logic Quarterly44:4 (1998) 545-552
Bridges, Douglas S. and Ishihara, Hajime, Constructive unbounded operators, in: Schuster, Peter and Berger, Ulrich and Osswald, Horst (eds.), Reuniting the antipodes–constructive and nonstandard views of the continuum (Venice, 1999), vol. 306 of Synthese Library, Kluwer Acad. Publ., Dordrecht, 2001, pages 25-37
Bridges, Douglas S. and Ishihara, Hajime, Constructive closed range and open mapping theorems, Indagationes Mathematicae11:4 (2001) 509-516
Bridges, Douglas S. and Ishihara, Hajime and Mines, Ray and Richman, Fred and Schuster, Peter M. and Vîţă, Luminiţa, Almost locatedness in uniform spaces, Czechoslovak Math. J.57:1 (2007) 1-12
Bridges, Douglas S. and Ishihara, Hajime and Schuster, Peter, Sequential Compactness in Constructive Analysis, Österr. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. II.208 (1999) 159-163
Bridges, Douglas S. and Ishihara, Hajime and Schuster, Peter, Compactness and continuity, constructively revisited, in: Bradfield, Julian (ed.), Computer science logic, vol. 2471 of Lecture Notes in Computer Science, Springer, 2002, pages 89-102
Bridges, Douglas S. and Ishihara, Hajime and Schuster, Peter and Vîţă, Luminiţa S., Strong continuity implies uniform sequential continuity, Archive for Mathematical Logic44:7 (2005) 887-895
Bridges, Douglas S. and Ishihara, Hajime and Schuster, Peter M. and Vîţă, Luminiţa, Apartness, compactness and nearness, Theoretical Computer Science405:1-2 (2008) 3-10
Bridges, Douglas S. and Ishihara, Hajime and Spitters, Bas, Locating the range of an operator with an adjoint, Indagationes Mathematicae13:4 (2003) 433-440
Bridges, Douglas S. and Ishihara, Hajime and Vîţă, Luminiţa, Computing infima on convex sets, with applications in Hilbert spaces, Proceedings of the American Mathematical Society132:9 (2004) 2723-2732
Bridges, Douglas S. and Ishihara, Hajime and Vîţă, Luminiţa, A new constructive version of Baire's Theorem, Hokkaido Math. Journal35:1 (2006) 107-118
Bridges, Douglas S. and Julian, William and Mines, Ray, A constructive treatment of open and unopen mapping theorems, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik35:1 (1989) 29-43
Bridges, Douglas S. and Mahalanobis, Ayan, Sequential continuity of functions in constructive analysis, Mathematical Logic Quarterly46:1 (2000) 139-143
Bridges, Douglas S. and Mahalanobis, Ayan, Increasing, nondecreasing, and virtually continuous functions, Journal of Automata, Languages and Combinatorics6:2 (2001) 139-143
Bridges, Douglas S. and Mahalanobis, Ayan, Bounded variation implies regulated: a constructive proof, The Journal of Symbolic Logic66:4 (2001) 1695-1700
Bridges, Douglas S. and Mines, Ray, Sequentially continuous linear mappings in constructive analysis, The Journal of Symbolic Logic63:2 (1998) 579-583
Bridges, Douglas S. and Mines, Ray and Richman, Fred and Schuster, Peter, The polydisk Nullstellensatz, Proceedings of the American Mathematical Society132:7 (2004) 2133-2140
Bridges, Douglas S. and Popa, Gabriela, Exact, continuous boundary crossings out of convex sets in R^N, The Quarterly Journal of Mathematics54:4 (2003) 391-398
Bridges, Douglas S. and Reeves, Steve, Constructive mathematics in theory and programming practice, Philosophia Mathematica. Philosophy of Mathematics, its Learning, and its Application. Series III7:1 (1999) 65-104
Bridges, Douglas S. and Richman, Fred, Varieties of Constructive Mathematics, vol. 97 of London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, 1987
Bridges, Douglas S. and Richman, Fred, A recursive counterexample to Debreu's theorem on the existence of a utility function, Mathematical Social Sciences21:2 (1991) 179-182
Bridges, Douglas S. and Richman, Fred and Schuster, Peter, Linear independence without choice, Annals of Pure and Applied Logic101:1 (2000) 95-102
Bridges, Douglas S. and Richman, Fred and Schuster, Peter, A weak countable choice principle, Proceedings of the American Mathematical Society128:9 (2000) 2749-2752
Bridges, Douglas S. and Richman, Fred and Schuster, Peter, Adjoints, absolute values, and polar decompositions, J. Operator Theory44:2 (2000) 243-254
Bridges, Douglas S. and Richman, Fred and Yuchuan, Wang, Sets, complements and boundaries, Indagationes Mathematicae7:4 (1996) 425-445
Bridges, Douglas S. and Schuster, Peter, A simple constructive proof of Kronecker's density theorem, Elemente der Mathematik61 (2006) 152-154
Bridges, Douglas S. and Schuster, Peter and Vîţă, Luminiţa, Apartness, Topology, and Uniformity: a Constructive View, Mathematical Logic Quarterly48:Suppl. 1 (2002) 16-28
Bridges, Douglas S. and Svozil, Karl, Constructive mathematics and quantum physics, J. Theor. Physics39 (2000) 501-513
Bridges, Douglas S. and van Dalen, Dirk and Ishihara, Hajime, Ishihara's proof technique in constructive analysis, Indagationes Mathematicae14:2 (2003) 163-168
Bridges, Douglas S. and Vîţă, Luminita, Constructing the infimum of two projections, in: Computation, physics and beyond, vol. 7160 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2012, pages 46-58
Bridges, Douglas S. and Vîţă, Luminiţa, Constructing extensions of ultraweakly continuous linear functionals, J. Functional Analysis178:2 (2000) 421-434
Bridges, Douglas S. and Vîţă, Luminiţa, Characterising Near Continuity Constructively, Mathematical Logic Quarterly47:4 (2001) 535-538
Bridges, Douglas S. and Vîţă, Luminiţa, Cauchy nets in the constructive theory of apartness spaces, Scientiae Mathematicae Japonicae56:1 (2002) 123-132
Bridges, Douglas S. and Vîţă, Luminiţa, Apartness spaces as a framework for constructive topology, Annals of Pure and Applied Logic119:1-3 (2003) 61-83
Bridges, Douglas S. and Vîţă, Luminiţa, A proof-technique in uniform space theory, The Journal of Symbolic Logic68:3 (2003) 795-802
Bridges, Douglas S. and Vîţă, Luminiţa, Separatedness in constructive topology, Documenta Mathematica8 (2003) 567-576
Bridges, Douglas S. and Vîţă, Luminiţa, Cauchy nets in uniform apartness spaces, Revue Roumaine de Mathématiques Pures et Appliquées48:5-6 (2003) 467-474
Bridges, Douglas S. and Vîţă, Luminiţa, Strong and uniform continuity–the uniform space case, LMS Journal of Computation and Mathematics6 (2003) 326-334
Bridges, Douglas S. and Vîţă, Luminiţa, Corrigendum to: "A proof-technique in uniform space theory", The Journal of Symbolic Logic69:1 (2004) 328
Bridges, Douglas S. and Vîţă, Luminiţa, A general constructive proof technique, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 31-43
Bridges, Douglas S. and Vîţă, Luminiţa, An extension theorem for ultraweakly continuous linear functionals on B(X,Y), in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 77-89
Bridges, Douglas S. and Vîţă, Luminiţa, Proximal connectedness, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 91-101
Bridges, Douglas S. and Vîţă, Luminiţa, Proximal Connectedness, Fundamenta Informaticae83:1-2 (2008) 25-34
Bridges, Douglas S. and Vîţă, Luminiţa Simona, Techniques of Constructive Analysis, Springer, New York, 2006
Bridges, Douglas S. and Vîţă, Luminiţa Simona, Journey into apartness space, in: Logicism, intuitionism, and formalism, vol. 341 of Synth. Libr., Springer, Dordrecht, 2009, pages 167-187
Bridges, Douglas S. and Vîţă, Luminiţa Simona, Apartness and Uniformity, Theory and Applications of Computability, Springer, Heidelberg, 2011
Bridges, Douglas S. and Wang, Yuchuan, Constructive aspects of the Dirichlet problem, Journal of Universal Computer Science3:11 (1997) 1148-1161 (electronic)
Bridges, Douglas S. and Wang, Yuchuan, Constructing cutoff functions, New Zealand Journal of Mathematics26:1 (1997) 25-30
Bridges, Douglas S. and Wang, Yuchuan, Constructive weak solutions of the Dirichlet problem, The Journal of the London Mathematical Society. Second Series57:3 (1998) 655-667
Bridges, Douglas S. and Wang, Yuchuan, Constructing best approximations on a Jordan curve, Journal of Approximation Theory94:2 (1998) 222-234
Bridges, Douglas S. and Wang, Yuchuan, Weak solutions of the Dirichlet problem and the locatedness of H^1_0(Ω), New Zealand Journal of Mathematics27:1 (1998) 1-5
Bridges, Douglas S. and Ward, Nicholas Dudley, Kernels of seminorms in constructive analysis, Theoretical Computer Science284:2 (2002) 259-267
Briseid, E. M., Addendum to the paper: "Some results on Kirk's asymptotic contractions" [Fixed Point Theory 8 (2007), no. 1, 17-27, Fixed Point Theory8:2 (2007) 321-322
Briseid, E. M., Fixed points of generalized contractive mappings, Journal of Nonlinear and Convex Analysis9:2 (2008) 181-204
Briseid, Eyvind, A rate of convergence for asymptotic contractions, J. Math. Anal. Appl.330 (2007) 364-376
Briseid, Eyvind, Some results on Kirk's asymptotic contractions, Fixed Point Theory8 (2007) 17-27
Briseid, Eyvind Martol, A new uniformity for asymptotic contractions in the sense of Kirk, Int. J. Math. Stat.6:S10 (2010) 2-13
Brodhead, Paul, Enumerations of Π^0_1 classes: acceptability and decidable classes, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 289-301
Brodhead, Paul and Cenzer, Douglas and Dashti, Seyyed, Random Closed Sets, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 55-64
Brodhead, Paul and Cenzer, Douglas and Remmel, Jeffrey B., Random Continuous Functions, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007
Brodhead, Paul and Cenzer, Douglas and Toska, Ferit and Wyman, Sebastian, Algorithmic randomness and capacity of closed sets, Log. Methods Comput. Sci.7:3 (2011) 3:16, 16
Brouwer, L.E.J., An intuitionist correction of the fixed-point theorem on the sphere, Proceedings of the Royal Society. London. Series A.213 (1952) 1-2
Brouwer, L.E.J., Points and spaces, Canad. Journ. Math.6 (1954) 1-17
Brouwer, L.E.J., The unreliability of logical principles, in: Heyting, A. (ed.), Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, North-Holland, Amsterdam, 1975, pages 107-111
Brouwer, L.E.J., Fixed cores which cannot be found, though they are claimed to exist by classical theorems, in: Heyting, A. (ed.), Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, North-Holland, Amsterdam, 1975, pages 516-518
Brouwer, L.E.J., Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, North-Holland, Amsterdam, 1975
Buescu, J. and Graça, D. S. and Zhong, N., Computability and dynamical systems, in: Dynamics, games and science. I, vol. 1 of Springer Proc. Math., Springer, Heidelberg, 2011, pages 169-181
Burnik, Konrad and Iljazović, Zvonko, Computability of 1-manifolds, Logical Methods in Computer Science10:2 (2014) 2:8, 28
Burrows, Ashley and Lester, David, Exact Arithmetic and the Korteweg-de Vries Equation, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 23-41
Buser, Peter and Scarpellini, Bruno, Undecidable propositions by ODE's, Annales Academiæ Scientiarum Fennicæ . Mathematica32:2 (2007) 317-340
Buy, Dmitry, Some Remarks about Fixpoint Theorems, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 43-52
Callard, Antonin and Hoyrup, Mathieu, Descriptive Complexity on Non-Polish Spaces, in: Paul, Christophe and Bläser, Markus (eds.), 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), vol. 154 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pages 8:1-8:16
Calude, C. S. and Coles, R. and Hertling, P. H. and Khoussainov, B., Degree Theoretic Aspects of Computably Enumerable Reals, in: S. B. Cooper and J. K. Truss (eds.), Models and Computability, vol. 259 of London Math. Society Lecture Note Series, Cambridge University Press, Cambridge, 1999, pages 23-39
Calude, C.S. and Hertling, P. and Jürgensen, H. and Weihrauch, K., Randomness on Full Shift Spaces, Chaos, Solitons & Fractals12:3 (2001) 491-503
Calude, Cristian and Jürgensen, Helmut, Randomness as an invariant for number representations, in: Maurer, H. and Karhumäki, J. and Rozenberg, G. (eds.), Results and Trends in Theoretical Computer Science, Springer, Berlin, 1994, pages 44-66
Calude, Cristian S., A characterization of c.e. random reals, Theoretical Computer Science271 (2002) 3-14
Calude, Cristian S. and Hertling, Peter, Computable approximations of reals: An information-theoretic analysis, Fundamenta Informaticae33:2 (1998) 105-120
Calude, Cristian S. and Hertling, Peter and Khoussainov, Bakhadyr, Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?, Bulletin of the European Association for Theoretical Computer Science62 (1997) 199-207
Calude, Cristian S. and Hertling, Peter and Khoussainov, Bakhadyr and Yongge Wang, Recursively enumerable reals and Chaitin Ω numbers, in: Morvan, Michel et al. (eds.), STACS'98, vol. 1373 of Lecture Notes in Computer Science, Springer, Berlin, 1998, pages 596-606
Calude, Cristian S. and Hertling, Peter H. and Khoussainov, Bakhadyr and Wang, Yongge, Recursively enumerable reals and Chaitin Ω numbers, Theoretical Computer Science255 (2001) 125-149
Campagnolo, Manuel L. and Ojakian, Kerry, The methods of approximation and lifting in real computation, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 387-423
Campagnolo, Manuel L. and Ojakian, Kerry, Characterizing Computable Analysis with Differential Equations, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 23-35
Campagnolo, Manuel Lameiras, Computational Complexity of Real Valued Recursive Functions and Analog Circuits, PhD thesis, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisbon, 2001
Campagnolo, Manuel Lameiras, The Complexity of Real Recursive Functions, in: Calude, C.S. and Dinneen, M.J. and Peper, F. (eds.), Unconventional Models of Computation, vol. 2509 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 1-14
Campagnolo, Manuel Lameiras and Moore, Cristopher, Upper and lower bounds on continuous-time computation, in: Antoniou, I. and Calude, C.S. and Dinneen, M.J. (eds.), Unconventional Models of Computation, UMC2'K, Discrete Mathematics and Theoretical Computer Science, Springer, London, 2001, pages 135-153
Campagnolo, Manuel Lameiras and Moore, Cristopher and Costa, José Félix, Iteration, Inequalities, and Differentiability in Analog Computers, Journal of Complexity16:4 (2001) 642-660
Campagnolo, Manuel Lameiras and Moore, Cristopher and Costa, José Félix, An Analog Characterization of the Grzegorczyk Hierarchy, Journal of Complexity18:4 (2002) 977-1000
Cenzer, Douglas, Effective real dynamics, in: Crossley, John N. and Remmel, Jefferey B. and Shore, Richard A. and Sweedler, Moss E. (eds.), Logical Methods in Honor of Anil Nerode's Sixtieth Birthday, vol. 12 of Progress in Computer Science and Applied Logic, Birkhäuser, Boston, 1993, pages 162-177
Cenzer, Douglas, Π^0_1-classes in computability theory, in: Griffor, Edward R. (ed.), Handbook of Computability Theory, vol. 140 of Studies in Logic and the Foundations of Mathematics, Elsevier, Amsterdam, 1999, pages 37-85
Cenzer, Douglas and Dashti, Ali and Toska, Ferit and Wyman, Sebastian, Computability of countable subshifts, in: Programs, proofs, processes, vol. 6158 of Lecture Notes in Comput. Sci., Springer, Berlin, 2010, pages 88-97
Cenzer, Douglas and Dashti, S. Ali and King, Jonathan L.F., Effective Symbolic Dynamics, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 89-99
Cenzer, Douglas and Dashti, S. Ali and King, Jonathan L.F., Computable symbolic dynamics, Mathematical Logic Quarterly54:5 (2008) 460-469
Cenzer, Douglas and Hinman, Peter G., Medvedev degrees of generalized r.e. separating classes, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 203-223
Cenzer, Douglas and Jockusch, Jr., Carl G., Π_ 1^ 0 classes-Structure and Applications, in: Computability theory and its applications, vol. 257 of Contemporary Mathematics, American Mathematical Society, Providence, 2000, pages 39-59
Cenzer, Douglas and Kihara, Takayuki and Weber, Rebecca and Wu, Guohua, Immunity and non-cupping for closed sets, Tbilisi Mathematical Journal2 (2009) 77-94
Cenzer, Douglas and Laforte, Geoffrey and Wu, Guohua, Pseudojumps and Π^0_1 Classes, Journal of Logic and Computation19:1 (2009) 77-87
Cenzer, Douglas and Remmel, J.B., Π^0_1-classes in mathematics, in: Ershov, Yu. L. and Goncharov, S.S. and Nerode, A. and Remmel, J.B. and Marek, V.W. (eds.), Handbook of Recursive Mathematics, vol. 139 of Studies in Logic and the Foundations of Mathematics, Elsevier, Amsterdam, 1998, pages 623-821
Cenzer, Douglas and Remmel, Jeffrey B., Index sets in computable analysis, Theoretical Computer Science219 (1999) 111-150
Cenzer, Douglas and Remmel, Jeffrey B., Effectively closed sets and graphs of computable real functions, Theoretical Computer Science284:2 (2002) 279-318
Cenzer, Douglas and Remmel, Jeffrey B., Index sets for computable real functions, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 164-182
Cenzer, Douglas and Remmel, Jeffrey B., Index sets for ω-languages, Mathematical Logic Quarterly49:1 (2003) 22-33
Cenzer, Douglas and Rojas, Diego A., Online Computability and Differentiation in the Cantor Space, in: Manea, Florin and Miller, Russell G. and Nowotka, Dirk (eds.), Sailing Routes in the World of Computation, Springer, Cham, 2018, pages 136-145
Cenzer, Douglas and Weber, Rebecca and Wu, Guohua, Immunity for closed sets, in: Mathematical theory and computational practice, vol. 5635 of Lecture Notes in Comput. Sci., Springer, Berlin, 2009, pages 109-117
Ceĭtin, G.S., On a theorem of Cauchy in constructive analysis (Russian), Uspehi Mat. Nauk10 (1955) 207-209
Ceĭtin, G.S., Uniform recursiveness of algorithmic operators on general recursive functions and a canonical representation for constructive functions of a real argument (Russian), in: Proc. Third All-Union Math. Congr., Moscow 1956, Izdat. Akad. Nauk SSSR, Moscow, 1956, pages 188-189
Ceĭtin, G.S., Algorithmic Operators in Constructive Complete Separable Metric Spaces (Russian), Doklady Akademii Nauk128 (1959) 49-52
Ceĭtin, G.S., Algorithmic Operators in Constructive Metric Spaces (Russian), Tr. Mat. Inst. Steklov67 (1962) 295-361
Ceĭtin, G.S., Mean value theorems in constructive analysis (Russian), Tr. Mat. Inst. Steklov67 (1962) 362-384
Ceĭtin, G.S., Three theorems on constructive functions (Russian), Tr. Mat. Inst. Steklov72 (1964) 537-543
Ceĭtin, G.S., On upper bounds of recursively enumerable sets of constructive real numbers (Russian), Tr. Mat. Inst. Steklov113 (1970) 102-172
Ceĭtin, Gregory S. and Zaslavskiĭ, Igor D., Singular coverings and properties of constructive functions connected with them (Russian), Tr. Mat. Inst. Steklov67 (1962) 458-502
Ceĭtin, Gregory S. and Zaslavskiĭ, Igor D., A criterion of the rectifiability of constructive plane curves (Russian), Izv. Akad Nauk Armjan. SSR Ser. Mat.5 (1970) 434-440
Ceĭtin, Gregory S. and Zaslavskiĭ, Igor D., Yet another constructive variant of the Cauchy theorem (Russian), Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI)20 (1971) 36-39,282-283
Ceĭtin, Gregory S. and Zaslavskiĭ, Igor D. and Šanin N.A., Peculiarities of constructive mathematical analysis (Russian), in: Proc. Internat. Congr. Math., Mir, Moscow, 1968, pages 253-261
Chadzelek, Thomas, Analytische Maschinen, PhD thesis, Technische Fakultät der Universität des Saarlandes, Saarbrücken, 1998
Chadzelek, Thomas and Hotz, Günter, Analytic machines, Theoretical Computer Science219 (1999) 151-167
Chaitin, G.J., Incompleteness theorems for random reals, Adv. in Appl. Math.8 (1987) 119-146
Chen, Qingliang and Su, Kaile and Zheng, Xizhong, Primitive recursiveness of real numbers under different representation, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 303-324
Chen, Qingliang and Su, Kaile and Zheng, Xizhong, Primitive recursive real numbers, Mathematical Logic Quarterly53:4-5 (2007) 365-380
Chernavskya, A.V. and Leksineb, V.P., Unrecognizability of manifolds, Annals of Pure and Applied Logic141:3 (2006) 447-455
Chou, Arthur and Ko, Ker-I, Computational complexity of two-dimensional regions, SIAM Journal on Computing24 (1995) 923-947
Chou, Arthur W., Some complexity issues in complex analysis, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 91-98
Chou, Arthur W. and Ko, Ker-I, On the complexity of finding paths in a two-dimensional domain I: Shortest paths, Mathematical Logic Quarterly50:6 (2004) 551-572
Chou, Arthur W. and Ko, Ker-I, The computational complexity of distance functions of two-dimensional domains, Theoretical Computer Science337 (2005) 360-369
Ciaffaglione, Alberto and Di Gianantonio, Pietro, A Co-inductive Approach to Real Numbers, in: Coquand, Thierry and Dybjer, Peter and Nordström, Bengt and Smith, Jan (eds.), Types for Proofs and Programs, vol. 1956 of Lecture Notes in Computer Science, Springer, Berlin, 2000, pages 114-130
Ciaffaglione, Alberto and Di Gianantonio, Pietro, A Tour with Constructive Real Numbers, in: Callaghan, P. and Luo, Z. and McKinna, J. and Pollack, R. (eds.), Types for Proofs and Programs, vol. 2277 of LNCS, Springer, Berlin, 2002, pages 41-52
Ciaffaglione, Alberto and Di Gianantonio, Pietro, A certified, corecursive implementation of exact real numbers, Theoretical Computer Science351:1 (2006) 39-51
Ciobanu, Gabriel and Rusu, Dănuţ, Supermetrics over Apartness Lattice-Ordered Semigroup, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 191-200
Cipriani, Vittorio and Pauly, Arno, The Complexity of Finding Supergraphs, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 178-189
Collins, Pieter, Continuity and computability on reachable sets, Theoretical Computer Science341 (2005) 162-195
Collins, Pieter, Effective Computation for Nonlinear Systems, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 169-178
Collins, Pieter, Computability and Representations of the Zero Set, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 37-43
Collins, Pieter, Computability of Homology for Compact Absolute Neighbourhood Retracts, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 107-118
Collins, W., Provably recursive real numbers, Notre Dame J. Formal Logic19 (1978) 513-522
Collins, W. and Young, P., Discountinuities of provably correct operators on the provably recursive real numbers, The Journal of Symbolic Logic48 (1983) 913-920
Cook, Stephen A., Computability and complexity of higher type functions, in: Moschovakis, Y.N. (ed.), Logic from computer science, vol. 21 of Mathematical Sciences Research Institute Publications, Springer, New York, 1992, pages 51-72
Coquand, Thierry, Formal Topology and Constructive Mathematics: the Gelfand and Stone-Yosida Representation Theorems, Journal of Universal Computer Science11:12 (2005) 1932-1944
Costa, José Félix and Loff, Bruno and Mycka, Jerzy, The New Promise of Analog Computation, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 189-195
Couch, P. J. and Daniel, B. D. and McNicholl, Timothy H., Computing space-filling curves, Theory of Computing Systems50:2 (2012) 370-386
Dadush, Daniel and Végh, László A. and Zambelli, Giacomo, On finding exact solutions of linear programs in the oracle model, in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2022, pages 2700-2722
Dahlgren, Fredrik, Computability and continuity in metric partial algebras equipped with computability structures, Mathematical Logic Quarterly50:4,5 (2004) 486-500
Dahlgren, Fredrik, Partial Continuous Functions and Admissible Domain Representations, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 94-104
Davis, Martin, The myth of hypercomputation, in: Teuscher, Christof (ed.), Alan Turing: Life and Legacy of a Great Thinker, Springer, Berlin, Heidelberg, 2004, pages 195-211
de Brecht, Matthew, Topological and Algebraic Aspects of Algorithmic Learning Theory, PhD thesis, Graduate School of Informatics, Kyoto University, 2010
de Brecht, Matthew, Quasi-Polish spaces, Ann. Pure Appl. Logic164:3 (2013) 356-381
de Brecht, Matthew, Levels of Discontinuity, Limit-Computability, and Jump Operators, in: Brattka, Vasco and Diener, Hannes and Spreen, Dieter (eds.), Logic, Computation, Hierarchies, Ontos Mathematical Logic, Walter de Gruyter, Boston, 2014, pages 93-122
de Brecht, Matthew, Some Notes on Spaces of Ideals and Computable Topology, in: Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno (eds.), Beyond the Horizon of Computability, Springer International Publishing, Cham, 2020, pages 26-37
de Brecht, Matthew, Constructing the space of valuations of a quasi-Polish space as a space of ideals, in: Manea, Florin and Simpson, Alex (eds.), 30th EACSL Annual Conference on Computer Science Logic, vol. 216 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2022, page Art. No. 9, 10
de Brecht, Matthew and Schröder, Matthias and Selivanov, Victor, Base-Complexity Classification of QCB_0-Spaces (Extended Abstract), in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 156-166
de Brecht, Matthew and Yamamoto, Akihiro, Σ^0_α-Admissible Representations (Extended Abstract), in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), 6th International Conference on Computability and Complexity in Analysis (CCA 2009), vol. 11 of OpenAccess Series in Informatics (OASIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2009
De Jaeger, Frédéric and Escardó, Martín and Santini, Gabriele, On the computational content of the Lawson topology, Theoretical Computer Science357:1-3 (2006) 230-240
de Miguel Casado, Gregorio and García Chamizo, Juan Manuel and Signes Pont, María Teresa, Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 218-227
Dediu, Luminiţa and Bridges, Douglas S., Constructive notes on uniform and locally convex spaces, in: Ciobanu, G. and Pun, G. (eds.), Fundamentals of computation theory, vol. 1684 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pages 195-203
Deil, Thomas, Darstellungen und Berechenbarkeit reeller Zahlen, PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984
Demuth, Osvald, On Lebesgue integration in constructive analysis (Russian), Dokl. Akad. Nauk SSSR160 (1965) 1239-1241
Demuth, Osvald, The Lebesgue integral in constructive analysis (Russian), Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov.4 (1967) 30-43
Demuth, Osvald, A necessary and sufficient condition for the Riemann integrability of constructive functions, Dokl. Akad. Nauk SSSR176 (1967) 757-758
Demuth, Osvald, Fubini's theorem for the Riemann integral in constructive mathematics. (Russian), Comment. Math. Univ. Carolinae9 (1968) 677-686
Demuth, Osvald, The Lebesgue integral and the concept of measurability of functions in constructive analysis (Russian), Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov.8 (1968) 21-28
Demuth, Osvald, The connection between Riemann and Lebesgue integrability of constructive functions (Russian), Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov.8 (1968) 29-31
Demuth, Osvald, Note on the paper: "Fubini's theorem for the Riemann integral in constructive mathematics" (Russian), Comment. Math. Univ. Carolinae10 (1969) 115-120
Demuth, Osvald, The differentiability of constructive functions (Russian), Comment. Math. Univ. Carolinae10 (1969) 167-175
Demuth, Osvald, The spaces L_n and S in constructive mathematics (Russian), Comment. Math. Univ. Carolinae10 (1969) 261-284
Demuth, Osvald, Linear functionals in the constructive spaces L_r (Russian), Comment. Math. Univ. Carolinae10 (1969) 357-390
Demuth, Osvald, The Lebesgue measurability of sets in constructive mathematic (Russian), Comment. Math. Univ. Carolinae10 (1969) 463-492
Demuth, Osvald, The representability of constructive functions of weakly bounded variation (Russian), Comment. Math. Univ. Carolinae11 (1970) 421-434
Demuth, Osvald, Mean value theorems for the constructive Lebesgue integral (Russian), Comment. Math. Univ. Carolinae11 (1970) 249-269
Demuth, Osvald, The representability of constructive functions of weakly bounded variation (Russian), Comment. Math. Univ. Carolinae11 (1970) 421-434
Demuth, Osvald, The integrability of derivatives of constructive functions (Russian), Comment. Math. Univ. Carolinae11 (1970) 667-691
Demuth, Osvald, Necessary and sufficient conditions for the absolute continuity of constructive functions (Russian), Comment. Math. Univ. Carolinae11 (1970) 705-726
Demuth, Osvald, The superpositions of absolutely continuous constructive functions (Russian), Comment. Math. Univ. Carolinae12 (1971) 423-451
Demuth, Osvald, A necessary and sufficient condition for the representability of constructive functions in the form of the sum of a singular and an absolutely continuous function (Russian), Comment. Math. Univ. Carolinae12 (1971) 587-610
Demuth, Osvald, A certain condition for the differentiability of constructive functions of bounded variation (Russian), Comment. Math. Univ. Carolinae12 (1971) 687-711
Demuth, Osvald, A necessary and sufficient condition for the representability of constructive functions in the form of a superposition of absolutely continuous functions (Russian), Comment. Math. Univ. Carolinae13 (1972) 227-251
Demuth, Osvald, A sufficient condition for the representability of constructive functions in the form of the sum of two superpositions of absolutely continuous functions (Russian), Comment. Math. Univ. Carolinae13 (1972) 265-282
Demuth, Osvald, The representability of uniformly continuous constructive functions (Russian), Comment. Math. Univ. Carolinae14 (1973) 7-25
Demuth, Osvald, The constructive analogue of the connection between the Lebesgue measurability of sets and of functions (Russian), Comment. Math. Univ. Carolinae14 (1973) 377-396
Demuth, Osvald, The representability of constructive functions possessing the properties ( S) and ( T_1) in the form of superpositions (Russian), Comment. Math. Univ. Carolinae15 (1974) 49-64
Demuth, Osvald, The connection between the representability of a constructive function in the form of a superposition of two absolutely continuous functions and the differentiability of this function (Russian), Comment. Math. Univ. Carolinae15 (1974) 195-210
Demuth, Osvald, The differentiability of constructive functions of weakly bounded variation on pseudo numbers (Russian), Comment. Math. Univ. Carolinae16:3 (1975) 583-599
Demuth, Osvald, The constructive analogue of the Denjoy-Young theorem on derived numbers (Russian), Comment. Math. Univ. Carolinae17:1 (1976) 111-126
Demuth, Osvald, The domains of definition of effective operators over general recursive functions and of constructive functions of a real variable (Russian), Comment. Math. Univ. Carolinae17:4 (1976) 633-646
Demuth, Osvald, A constructive analogue of the functions of the nth Baire class (Russian), Comment. Math. Univ. Carolinae18:2 (1977) 231-245
Demuth, Osvald, A generalization of the constructive Lebesgue integral (Russian), Comment. Math. Univ. Carolinae18:3 (1977) 499-514
Demuth, Osvald, Some questions of the theory of constructive functions of a real variable (Russian), Acta Universitatis Carolinae. Mathematica et Physica19:1 (1978) 61-96
Demuth, Osvald, The pseudodifferentiability of uniformly continuous constructive functions on constructive real numbers (Russian), Comment. Math. Univ. Carolin.19:2 (1978) 319-333
Demuth, Osvald, Constructive analogues of generalized absolutely continuous functions of generalized bounded variation (Russian), Commentationes Mathematicae Universitatis Carolinae19:3 (1978) 471-487
Demuth, Osvald, The use of the Riemann-Stieltjes integral in the theory of the constructive Lebesgue integral, and its generalizations (Russian), Commentationes Mathematicae Universitatis Carolinae20:4 (1979) 781-793
Demuth, Osvald, On the constructive Perron integral (Russian), Acta Universitatis Carolinae. Mathematica et Physica21:1 (1980) 3-57
Demuth, Osvald, A constructive analogue of K. M. Garg's theorem on derivative numbers (Russian), Commentationes Mathematicae Universitatis Carolinae21:3 (1980) 457-472
Demuth, Osvald, Pseudodifferentiability of constructive functions on constructive real numbers (Russian), Commentationes Mathematicae Universitatis Carolinae21:3 (1980) 489-505
Demuth, Osvald, On the pseudodifferentiability of uniformly continuous constructive functions from functions of the same type (Russian), Commentationes Mathematicae Universitatis Carolinae22:3 (1981) 497-512
Demuth, Osvald, A generalization of a constructive analogue of K. M. Garg's theorem (Russian), Commentationes Mathematicae Universitatis Carolinae22:3 (1981) 607-620
Demuth, Osvald, Borel types of some classes of arithmetical real numbers (Russian), Commentationes Mathematicae Universitatis Carolinae23:3 (1982) 593-606
Demuth, Osvald, Some classes of arithmetical real numbers (Russian), Commentationes Mathematicae Universitatis Carolinae23:3 (1982) 453-465
Demuth, Osvald, Arithmetic complexity of differentiation in constructive mathematics (Russian), Commentationes Mathematicae Universitatis Carolinae24:2 (1983) 301-316
Demuth, Osvald, On the pseudodifferentiability of pseudo-uniformly continuous constructive functions from functions of the same type (Russian), Commentationes Mathematicae Universitatis Carolinae24:3 (1983) 391-406
Demuth, Osvald, An example of the construction of pseudonumbers by the methods of recursion theory, in: Tonoyan, R.N. (ed.), Applied mathematics, No. 5 (Russian), Erevan. Univ., Erevan, 1987, pages 55-73, 131-132
Demuth, Osvald, Reducibilities of sets based on constructive functions of a real variable, Commentationes Mathematicae Universitatis Carolinae29:1 (1988) 143-156
Demuth, Osvald, Remarks on the structure of tt-degrees based on constructive measure theory, Commentationes Mathematicae Universitatis Carolinae29:2 (1988) 233-247
Demuth, Osvald, Remarks on Denjoy sets, in: Mathematical logic, Plenum, New York, 1990, pages 267-280
Demuth, Osvald and Filipec, Pavel, Differentiation of constructive functions of a real variable and relative computability, in: Skordev, D.G. (ed.), Mathematical Logic and Its Applications, Plenum Press, New York, 1987, pages 81-106
Demuth, Osvald and Kmínek, V., Properties of indefinite constructive Lebesgue-Stieltjes integrals (Russian), Commentationes Mathematicae Universitatis Carolinae21:4 (1980) 629-644
Demuth, Osvald and Kryl, R. and Kučera, A., The use of the theory of functions that are partial recursive relative to numerical sets in constructive mathematics (Russian), Acta Universitatis Carolinae. Mathematica et Physica19:1 (1978) 15-60
Demuth, Osvald and Kučera, A., Remarks on constructive mathematical analysis, in: Logic Colloquium '78 (Mons, 1978), North-Holland, Amsterdam, 1979, pages 81-129
Demuth, Osvald and Kučera, A., Remarks on 1-genericity, semigenericity and related concepts, Commentationes Mathematicae Universitatis Carolinae28:1 (1987) 85-94
Demuth, Osvald and Nemečkova, L., The constructive analogue of the property (T_1) (Russian), Comment. Math. Univ. Carolinae14 (1973) 421-439
Demuth, Osvald and Němečková, L., The constructive analogues of the properties (N) and (S) (Russian), Comment. Math. Univ. Carolinae14 (1973) 565-582
Demuth, Osvald and Polivka, Ĭ., The representation of linear functionals in the space of codes of constructive functions that are uniformly continuous on the segment 0Δ 1 (Russian), Commentationes Mathematicae Universitatis Carolinae20:4 (1979) 765-780
Demuth, Oswald, A notion of semigenericity, Commentationes Mathematicae Universitatis Carolinae28:1 (1987) 71-84
Dettki, H.J. and Schuster, H. and Weihrauch, K., Type 2 recursion theory, in: Demetrovics, J. and Katona, G. and Salomaa, A. (eds.), Algebra, Combinatorics and Logic in Computer Science, Vol. 1, vol. 42 of Coll. Math. Soc. János Bolyai, 1986, pages 355-361
Dettki, Hans Joachim, Untersuchungen zur Darstellungsberechenbarkeit von Ordinalzahlfunktionen, PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1985
Di Gianantonio, Pietro, A Functional Approach to Computability on Real Numbers, PhD thesis, Università di Pisa-Genova-Udine, Udine, 1993
Di Gianantonio, Pietro, Real number computation and Domain Theory, Information and Computation127 (1996) 11-25
Di Gianantonio, Pietro, An abstract data type for real numbers, Theoretical Computer Science221 (1999) 295-326
Di Gianantonio, Pietro and Edalat, Abbas, A Language for Differentiable Functions, in: Pfenning, Frank (ed.), Foundations of Software Science and Computation Structures (FoSSaCS'13), vol. 7794 of Lecture Notes in Computer Science, Springer, Berlin, 2013, pages 337-352
Diamondstone, David and Kjos-Hanssen, Bjørn, Members of Random Closed Sets, in: Ambos-Spies, Klaus and Löwe, Benedikt and Merkle, Wolfgang (eds.), Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, vol. 5635 of Lecture Notes in Computer Science, Springer, 2009, pages 144-153
Diener, Hannes and Hendtlass, Matthew, The Third Trick, Logical Methods in Computer Science18:3 (2022) 21:1-21:12
Diener, Hannes and Ishihara, Hajime, Bishop-Style Constructive Reverse Mathematics, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 347-365
Diener, Hannes and Loeb, Iris, Constructive reverse investigations into differential equations, Journal of Logic and Analysis3 (2011) Paper 8, 26
Diener, Hannes and Lubarsky, Robert, Notions of Cauchyness and metastability, in: Logical foundations of computer science, vol. 10703 of Lecture Notes in Comput. Sci., Springer, Cham, 2018, pages 140-153
Diener, Hannes and Schuster, Peter, On choice principles and fan theorems, J.UCS16:18 (2010) 2556-2562
Dillhage, Ruth, Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 365-384
Dillhage, Ruth and Brattka, Vasco, Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 45-60
Ding, Decheng and Weihrauch, Klaus and Wu, Yongcheng, Absolutely non-effective predicates and functions in Computable Analysis, in: Cai, Jin-Yi and Cooper, S. Barry and Zhou, Hong (eds.), Theory and Applications of Models of Computation, vol. 4484 of Lecture Notes in Computer Science, 2007, pages 595-604
Dorais, François G. and Dzhafarov, Damir D. and Hirst, Jeffry L. and Mileti, Joseph R. and Shafer, Paul, On uniform relationships between combinatorial problems, Transactions of the American Mathematical Society368:2 (2016) 1321-1359
Downey, Rod and Kalantari, Iraj, Effective extensions of linear forms on a recursive vector space over a recursive field, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik31:3 (1985) 193-200
Downey, Rod and Terwijn, Sebastiaan, Computably Enumerable Reals and Uniformly Presentable Ideals, Mathematical Logic Quarterly48:Suppl. 1 (2002) 29-40
Downey, Rod and Wu, Guohua and Zheng, Xizhong, Degrees of d.c.e. reals, Mathematical Logic Quarterly50:4,5 (2004) 345-350
Downey, Rod G. and Griffiths, Evan J., Schnorr Randomness, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Downey, Rod G. and Griffiths, Evan J. and LaForte, Geoffrey L., On Schnorr and computable randomness, martingales, and machines, Mathematical Logic Quarterly50:6 (2004) 613-627
Downey, Rod G. and Hirschfeldt, Denis R. and LaForte, Geoffrey L., Randomness and Reducibility, in: Sgall, Jiří and Pultr, Aleš and Kolman, Petr (eds.), Mathematical Foundations of Computer Science 2001, vol. 2136 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 316-327
Downey, Rod G. and Hirschfeldt, Denis R. and Nies, André and Stephan, Frank, Trivial Reals, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Downey, Rod G. and Hirschfeldt, Denis R. and Nies, André and Stephan, Frank, Trivial Reals, in: Downey, Rod and Decheng, Ding and Ping, Tung Shih and Hui, Qiu Yu and Yasugi, Mariko (eds.), Proceedings of the 7th and 8th Asian Logic Conferences, World Scientific, Singapore, 2003, pages 63-102
Downey, Rodney and Merkle, Wolfgang and Reimann, Jan, Schnorr dimension, Mathematical Structures in Computer Science16:5 (2006) 789-811
Downey, Rodney G., Presentations of reals (Abstract), in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 11-12
Downey, Rodney G. and LaForte, Geoffrey L., Presentations of computably enumerable reals, Theoretical Computer Science284:2 (2002) 539-555
Downey, Rodney G. and Melnikov, Alexander G., Computable Analysis and Classification Problems, in: Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno (eds.), Beyond the Horizon of Computability, Springer International Publishing, Cham, 2020, pages 100-111
Du, D. and Ko, Ker-I, Computational complexity of integration and differentiation of convex functions, System Sci. and Math. Sci.2 (1989) 70-79
Du, D. and Ko, Ker-I, A note on best fractions of a computable real number, Journal of Complexity8 (1992) 216-229
Du, Ding-Zhu and Wang, Jie, In Memoriam: Ker-I Ko (1950-2018), in: Du, Ding-Zhu and Wang, Jie (eds.), Complexity and Approximation: In Memory of Ker-I Ko, Springer, Cham, 2020, pages 1-7
Du, Zilin and Eleftheriou, Maria and Moreira, José E. and Yap, Chee, Hypergeometric Functions in Exact Geometric Computation, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Dummett, M., The Philosophical Basis of Intuitionistic Logic, in: Rose, H.E. and Shepherdson, J.C. (eds.), Logic Colloquium '73, vol. 80 of Stud. Logic. Found. Math., 1975, pages 5-40
Dummett, M., Elements of Intuitionism, Oxford Univ. Press, 1977
Dunlop, Anthony J. and Pour-El, Marian B., The Degree of Unsolvability of a Real Number, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 16-29
Edalat, Abbas, Domain theory and integration, Theoretical Computer Science151 (1995) 163-193
Edalat, Abbas, Dynamical systems, measures, and fractals via domain theory, Information and Computation120:1 (1995) 32-48
Edalat, Abbas, Power domains and iterated function systems, Information and Computation124:2 (1996) 182-197
Edalat, Abbas, The Scott Topology Induces the Weak Topology, in: LICS '96: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society, Washington, DC, USA, 1996, page 372
Edalat, Abbas, Domains for Computation in Mathematics, Physics and Exact Real Arithmetic, Bulletin of Symbolic Logic3:4 (1997) 401-452
Edalat, Abbas, A Continuous Derivative for Real-Valued Functions, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 248-257
Edalat, Abbas, A computable approach to measure and integration theory, in: LICS '07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society, Washington, DC, USA, 2007, pages 463-472
Edalat, Abbas, A computable approach to measure and integration theory, Information and Computation207:5 (2009) 642-659
Edalat, Abbas, Extensions of domain maps in differential and integral calculus, in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015), IEEE Computer Soc., Los Alamitos, CA, 2015, pages 426-437
Edalat, Abbas and Escardó, Martín Hötzel, Integration in real PCF, Information and Computation160 (2001) 128-166
Edalat, Abbas and Heckmann, Reinhold, A computational model for metric spaces, Theoretical Computer Science193 (1998) 53-73
Edalat, Abbas and Kashefi, Elham and Lieutier, André, The Convex Hull is Computable!, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 75-77
Edalat, Abbas and Khanban, Ali A. and Lieutier, André, Computability in Computational Geometry, in: Cooper, Barry S. and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 117-127
Edalat, Abbas and Krznarić, Marko, Numerical Integration with Exact Real Arithmetic, in: Wiedermann, Jiří and van Emde Boas, Peter and Nielsen, Mogens (eds.), Automata, Languages and Programming, vol. 1644 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pages 90-104
Edalat, Abbas and Lieutier, André, Domain of Differentiable Functions, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, page 79
Edalat, Abbas and Lieutier, André, Foundation of a computable solid modelling, Theoretical Computer Science284:2 (2002) 319-345
Edalat, Abbas and Maleki, Mehrdad, Differentiation in logical form, in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, Piscataway, NJ, 2017, page 12
Edalat, Abbas and Maleki, Mehrdad, Differential calculus with imprecise input and its logical framework, in: Foundations of software science and computation structures, vol. 10803 of Lecture Notes in Comput. Sci., Springer, Cham, 2018, pages 459-475
Edalat, Abbas and Pattinson, Dirk, Initial value problems in domain theory, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 211-227
Edalat, Abbas and Pattinson, Dirk, A domain-theoretic account of Picard's theorem, LMS Journal of Computation and Mathematics10 (2007) 83-118
Edalat, Abbas and Potts, Peter John, A new representation for exact real numbers, Electronical Notes in Theoretical Computer Science6 (1997) 14 pp.
Edalat, Abbas and Rico, Fabien, Root Finding in Exact Real Arithmetic Using Linear Fractional Transformations, in: Chesneaux, J.-M. and Jézéquel, F. and Lamotte, J.-L. and Vignes, J. (eds.), Third Real Numbers and Computers Conference, Université Pierre et Marie Curie, Paris, 1998, pages 27-43
Edalat, Abbas and Sünderhauf, Philipp, A domain-theoretic approach to computability on the real line, Theoretical Computer Science210 (1999) 73-98
Edalat, Abbas and Sünderhauf, Philipp, Computable Banach spaces via domain theory, Theoretical Computer Science219 (1999) 169-184
Eršov, Ju. L., Computable functionals of finite type, Algebra and Logic11:4 (1972) 203-242
Esbelin, Henri Alex, Une classe minimale de fonctions récursives contenant les relations rudimentaires, C. R. Acad. Sci. Paris Sér. I Math.319:5 (1994) 505-508
Esbelin, Henri-Alex, Rudimentary computable reals, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 21-30
Esbelin, Henri-Alex, Rudimentarity of two famous real numbers, in: Studies in weak arithmetics, vol. 196 of CSLI Lecture Notes, CSLI Publ., Stanford, CA, 2010, pages 121-126
Escardó, Martín Hötzel, PCF extended with real numbers, Theoretical Computer Science162 (1996) 79-115
Escardó, Martín Hötzel, PCF extended with real numbers: a domain-theoretic approach to higher-order exact real number computation, PhD thesis, Imperial College, University of London, London, Great Britain, 1997
Escardó, Martín Hötzel and Streicher, Thomas, Induction and recursion on the partial real line with applications to Real PCF, Theoretical Computer Science210 (1999) 121-157
Escardó, Martín Hötzel and Streicher, Thomas, In Domain Realizability Not All Functionals on C[-1,1] are Continuous, Mathematical Logic Quarterly48:Suppl. 1 (2002) 41-44
Escardó, Martín and Pauly, Arno and Schröder, Matthias and Weihrauch, Klaus (eds.), Special issue: Selected papers of the Ninth International Conference on Computability and Complexity in Analysis (CCA) 2012, Held in Cambridge, June 24-27, 2012, Logical Methods in Computer Science, 2013/14
Esposti, Mirko Degli and Galatolo, Stefano, Recurrence near given sets and the complexity of the Casati-Prosen map, Chaos Solitons Fractals23:4 (2005) 1275-1284
Farjudian, Amin, Polynomial-time solution of initial value problems using polynomial enclosures, in: Ong, L. and de Queiroz, R. (eds.), Logic, Language, Information and Computation, vol. 7456 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 232-245
Farjudian, Amin, Computable Analysis of Linear Rearrangement Optimization, in: Gopal, T.V. and Watada, Junzo (eds.), Theory and Applications of Models of Computation, vol. 11436 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 172-187
Feferman, S., Systems of predicative analysis, The Journal of Symbolic Logic29 (1964) 1-30
Feferman, S., Theories of finite type related to mathematical practice, in: Barwise, J. (ed.), Handbook of Mathematical Logic, vol. 90 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1977, pages 913-971
Feferman, S., Constructive Theories of Functions and Classes, in: Boffa, D., van Dalen and McAloon, K. (eds.), Proceedings Logic Colloquium '78, vol. 97 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1979, pages 159-224
Feferman, S., Between constructive and classical mathematics, in: Richter, M.M. and Börger, E. and Oberschelp, W. and Schinzel, B. and Thomas, W. (eds.), Computation and Proof Theory, vol. 1104 of Lecture Notes in Mathematics, 1984, pages 143-162
Ferreira, Fernando, On False Heine/Borel Compactness Principles in Proof Mining, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 199-203
Fouché, Willem L., Fractals generated by algorithmically random Brownian motion, in: Klaus Ambos-Spies and Benedikt Löwe and Wolfgang Merkle (eds.), Mathematical Theory and Computational Practice, vol. 5635 of Lecture Notes in Computer Science, Springer, Berlin, 2009, pages 208-217
Fouché, Willem L., Diophantine properties of Brownian motion: recursive aspects, in: Brattka, Vasco and Diener, Hannes and Spreen, Dieter (eds.), Logic, Computation, Hierarchies, vol. 4 of Ontos Mathematical Logic, De Gruyter, Boston, 2014, pages 139-156
Fouché, Willem, Arithmetical Representation of Brownian Motion I, The Journal of Symbolic Logic65 (2000) 421-442
Fouché, Willem, The Descriptive Complexity of Brownian Motion, Advances in Mathematics155 (2000) 317-343
Fouché, Willem, An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 61-69
Fouché, Willem, Dynamics of a generic Brownian motion: Recursive aspects, Theoretical Computer Science394 (2008) 175-186
Fourman, Michael and Hyland, John M. E., Sheaf models for analysis, in: Michael Fourman and Christopher Mulvey and Dana Scott (eds.), Applications of Sheaves, vol. 753 of Lecture Notes in Mathematics, Springer, Berlin/Heidelberg, 1979, pages 280-301
Franklin, Johanna N. Y., A Church-Turing Thesis for Randomness?, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 217-226
Franklin, Johanna N. Y. and Greenberg, Noam and Miller, Joseph S. and Ng, Keng Meng, Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets, Proceedings of the American Mathematical Society140:10 (2012) 3623-3628
Franklin, Johanna N. Y. and Towsner, Henry, Randomness and non-ergodic systems, Moscow Mathematical Journal14:4 (2014) 711-744, 827
Franklin, Johanna N.Y., Schnorr trivial reals: a construction, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 79-93
Franklin, Johanna N.Y., Relativization in randomness, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 134-174
Franklin, Johanna N.Y. and Porter, Christopher P., Key developments in algorithmic randomness, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 1-39
Fred Richman, Intuitionism As Generalization, Philosophia Mathematica1 (1990) 124-128
Freer, Cameron E. and Roy, Daniel M., Computable exchangeable sequences have computable de Finetti measures, in: Klaus Ambos-Spies and Benedikt Löwe and Wolfgang Merkle (eds.), Mathematical Theory and Computational Practice, vol. 5635 of Lecture Notes in Computer Science, Springer, Berlin, 2009, pages 218-231
Freer, Cameron E. and Roy, Daniel M., Computable de Finetti measures, Annals of Pure and Applied Logic163:5 (2012) 530-546
Freund, Rudolf, Real Functions and Numbers Defined by Turing Machines, Theoretical Computer Science23 (1983) 287-304
Freund, Rudolf and Staiger, Ludwig, Numbers defined via Turing machines, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 119-124
Freund, Rudolf and Staiger, Ludwig, Numbers defined by Turing machines, Collegium Logicum, Annals of the Kurt-Gödel-Society2 (1996) 118-137
Friedman, H.M., Set theoretic foundations for constructive analysis, Ann. of Math.105 (1977) 1-28
Friedman, Harvey, Some systems of second order arithmetic and their use, in: Proceedings of the International Congress of Mathematicians, Vancouver, 1974, pages 235-242
Fritz, Tobias and Netzer, Tim and Thom, Andreas, Can you compute the operator norm?, Proceedings of the American Mathematical Society142:12 (2014) 4265-4276
Fujiwara, Makoto and Ishihara, Hajime and Nemoto, Takako, Some principles weaker than Markov's principle, Archive for Mathematical Logic54:7-8 (2015) 861-870
Férée, Hugo and Hoyrup, Mathieu and Gomaa, Walid, On the query complexity of real functionals, in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013), IEEE Computer Soc., Los Alamitos, CA, 2013, pages 103-112
Férée, Hugo and Ziegler, Martin, On the computational complexity of positive linear functionals on C[0;1], in: Kotsireas, Ilias S. and Rump, Siegfried M. and Yap, Chee K. (eds.), Mathematical Aspects of Computer and Information Sciences, vol. 9582 of Lecture Notes in Computer Science, Springer, Cham, 2016, pages 489-504
Gaier, D., Konstruktive Methoden der konformen Abbildung, Tracts in Natural Philosophy, Springer, Berlin, 1964
Galatolo, Stefano, Pointwise information entropy for metric spaces, Nonlinearity12 (1999) 1289-1298
Galatolo, Stefano, Orbit computability by computable structures, Nonlinearity13 (2000) 1531-1546
Galatolo, Stefano, Complexity, initial condition sensitivity, dimension and weak chaos in dynamical systems, Nonlinearity16:4 (2003) 1219-1238
Galatolo, Stefano, Global and local complexity in weakly chaotic dynamical systems, Discrete and Continuous Dynamical Systems9:6 (2003) 1607-1624
Galeotti, Lorenzo, A Candidate for the Generalised Real Line, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 271-281
Galeotti, Lorenzo and Nobrega, Hugo, Towards Computable Analysis on the Generalized Real Line, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 246-257
Galicki, Aleksander and Nies, André, A Computational Approach to the Borwein-Ditor Theorem, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 99-104
Galicki, Alex, Randomness and Differentiability of Convex Functions, in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 196-205
Galicki, Alex, Polynomial-time Rademacher theorem, porosity and randomness, in: Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca (eds.), 44th International Colloquium on Automata, Languages, and Programming, vol. 80 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2017, page Art. No. 30, 13
Gambino, Nicola and Schuster, Peter, Spatiality for formal topologies, Mathematical Structures in Computer Science17 (2007) 65-80
Gao, Sicun and Avigad, Jeremy and Clarke, Edmund M., Delta-decidability over the reals, in: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE Computer Soc., Los Alamitos, CA, 2012, pages 305-314
Gao, Sicun and Avigad, Jeremy and Clarke, Edmund M., δ-complete decision procedures for satisfiability over the reals, in: Automated reasoning, vol. 7364 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2012, pages 286-300
Garzon, Max and Botelho, Fernanda, Real computation with cellular automata, in: Cellular automata and cooperative systems (Les Houches, 1992), vol. 396 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Kluwer Acad. Publ., Dordrecht, 1993, pages 191-202
Gay, William and Zhang, Bing-Yu and Zhong, Ning, Computability of Solutions of the Korteweg-de Vries Equation, Mathematical Logic Quarterly47:1 (2001) 93-110
Gaßner, Christine and Pauly, Arno and Steinberg, Florian, Computing measure as a primitive operation in real number computation, in: 29th EACSL Annual Conference on Computer Science Logic, vol. 183 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2021, page Art. No. 22, 22
Ge, Xiaolin, Some Algorithms in Euclidean Space and Group Representations, PhD thesis, University of Minnesota, Minneapolis, 1993
Ge, Xiaolin and Nerode, Anil, On extreme points of convex compact Turing located sets, in: Nerode, Anil and Matiyasevich, Yu. V. (eds.), Logical Foundations of Computer Science, vol. 813 of Lecture Notes in Computer Science, Springer, Berlin, 1994, pages 114-128
Ge, Xiaolin and Nerode, Anil, Effective content of the calculus of variations I: semi-continuity and the chattering lemma, Annals of Pure and Applied Logic78 (1996) 127-146
Ge, Xiaolin and Richards, J. Ian, Computability in unitary representations of compact groups, in: Crossley, John N. and Remmel, Jefferey B. and Shore, Richard A. and Sweedler, Moss E. (eds.), Logical Methods in Honor of Anil Nerode's Sixtieth Birthday, vol. 12 of Progress in Computer Science and Applied Logic, Birkhäuser, Boston, 1993, pages 386-421
Gelfond, Michael G., Constructive pseudofunctions (Russian), Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov.16 (1969) 20-27
Gelfond, Michael G., The relation between the classical and constructive versions of the construction of mathematical analysis (Russian), Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov.32 (1972) 5-11
Gelfond, Michael G., A class of theorems with valid constructive counterparts, in: Richman, Fred (ed.), Constructive mathematics, vol. 873 of Lecture Notes in Mathematics, Springer, Berlin, 1981, pages 314-320
Georgiev, Ivan, Dedekind Cuts and Long Strings of Zeros in Base Expansions, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 248-259
Georgiev, Ivan, Subrecursive Graphs of Representations of Irrational Numbers, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 154-165
Georgiev, Ivan and Kristiansen, Lars and Stephan, Frank, On General Sum Approximations of Irrational Numbers, in: Manea, Florin and Miller, Russell G. and Nowotka, Dirk (eds.), Sailing Routes in the World of Computation, Springer, Cham, 2018, pages 194-203
Geuvers, Herman and Niqui, Milad, Constructive reals in Coq: axioms and categoricity, in: Types for proofs and programs (Durham, 2000), vol. 2277 of Lecture Notes in Comput. Sci., Springer, Berlin, 2002, pages 79-95
Gherardi, Guido, Some Results in Computable Analysis and Effective Borel Measurability, PhD thesis, University of Siena, Department of Mathematics and Computer Science, Siena, 2006
Gherardi, Guido, Internal Computability, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 348-357
Gherardi, Guido and Marcone, Alberto, How Incomputable is the Separable Hahn-Banach Theorem?, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 85-102
Gilman, Jane, Computability models: algebraic, topological and geometric algorithms, in: Detinko, Alla and Kapovich, Michael and Kontorovich, Alex and Sarnak, Peter and Schwartz, Richard (eds.), Computational Aspects of Discrete Subgroups of Lie Groups, vol. 783 of Contemporary Mathematics, American Mathematical Society, Providence, RI, 2023, pages 57-68
Glivenko, V.I., Sur la logique de M. Brouwer, Roy. Belg. Bull. Cl. Sci.14 (1928) 225-228
Glivenko, V.I., Sur quelques points de la logique de M. Brouwer, Roy. Belg. Bull. Cl. Sci.15 (1929) 183-188
Goodman, N.D. and Myhill, J., The formalization of Bishop's constructive mathematics, in: Lawvere, F. W. (ed.), Toposes, Algebraic Geometry and Logic, vol. 274 of Lecture Notes in Mathematics, 1972, pages 83-96
Goodstein, R.L., Missing value theorems, Math. Gaz.33 (1949) 19-25
Goodstein, R.L., Mean value theorems in recursive function theory I. Differential mean value theorems, Proc. London Math. Soc.52 (1950) 81-106
Goodstein, R.L., The recursive irrationality of π, The Journal of Symbolic Logic19 (1954) 267-274
Goodstein, R.L., On non-constructive theorems of analysis and the decision problem, Math. Scand.3 (1956) 261-263
Goodstein, R.L., Recursive analysis, in: Heyting, A. (ed.), Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pages 37-42
Goodstein, R.L., Recursive Analysis, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1961
Goodstein, R.L., Existence in mathematics, Compositio Math.20 (1968) 70-82
Goodstein, R.L., A constructive form for the second Gauss proof of the fundamental theorem of algebra, in: Constructive Aspects of the Fundamental Theorem of Algebra, Willey-Interscience, NY, 1969, pages 69-76
Goodstein, R.L., Polynomials with computable coefficients, Notre Dame J. Formal Logic11 (1970) 447-448
Goodstein, R.L. and Hooley, J., On recursive transcendence, Notre Dame J. Formal Logic1 (1960) 127-137
Gordon, Dan and Shamir, Eliahu, Computation of recursive functionals using minimal initial segments, Theoretical Computer Science23 (1983) 305-315
Gori, Marco and Meer, Klaus, A Step towards a Complexity Theory for Analog Systems, Mathematical Logic Quarterly48:Suppl. 1 (2002) 45-58
Gorman, Alexi Block and Hieronymi, Philipp and Kaplan, Elliot and Meng, Ruoyu and Walsberg, Erik and Wang, Zihe and Xiong, Ziqin and Yang, Hongru, Continuous Regular Functions, Logical Methods in Computer Science16:1 (2020) 17:1-17:24
Gottwald, Siegfried, Dieter Klaua–obituary, Fuzzy Sets and Systems259 (2015) 126-127
Gowland, Paul and Lester, David, A Survey of Exact Arithmetic Implementations, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 30-47
Grayson, Robin J., Heyting-Valued Semantics, in: Lolli, G. and Longo, G. and Marcja, A. (eds.), Logic Colloquium '82, vol. 112 of Studies in Logic and the Foundations of Mathematics, Elsevier, 1984, pages 181-208
Graça, Daniel S., Calculability of the asymptotic behavior of dynamical systems, Boletim da Sociedade Portuguesa de Matemática :Special issue (2016) 95-98
Graça, Daniel S. and Buescu, Jorge and Campagnolo, Manuel L., Boundedness of the domain of definition is undecidable for polynomial ODEs, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 49-57
Graça, Daniel S. and Zhong, Ning, Computability of ordinary differential equations, in: Sailing routes in the world of computation, vol. 10936 of Lecture Notes in Computer Science, Springer, Cham, 2018, pages 204-213
Graça, Daniel S. and Zhong, Ning, Computability of Differential Equations, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 71-99
Graça, Daniel S. and Zhong, Ning, Computability of Limit Sets for Two-Dimensional Flows, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 494-503
Graça, Daniel Silva, Computability via analog circuits, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 229-240
Graça, Daniel Silva, Some recent developments on Shannon's General Purpose Analog Computer, Mathematical Logic Quarterly50:4,5 (2004) 473-485
Graça, Daniel Silva and Campagnolo, Manuel L. and Buescu, Jorge, Robust Simulations of Turing Machines with Analytic Maps and Flows, in: Cooper, S. Barry and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 169-179
Graça, Daniel Silva and Costa, José Félix, Analog computers and recursive functions over the reals, Journal of Complexity19:5 (2003) 644-664
Grilliot, Thomas J., On effectively discontinuous type-2 objects, The Journal of Symbolic Logic36 (1971) 245-248
Grubba, Tanja and Schröder, Matthias and Weihrauch, Klaus, Computable metrization, Mathematical Logic Quarterly53:4-5 (2007) 381-395
Grubba, Tanja and Weihrauch, Klaus, A computable version of Dini's Theorem for topological spaces, in: Yolum, Pinar and Güngör, Tunga and Gürgen, Fikret and Özturan, Can (eds.), Computer and Information Sciences - ISCIS 2005, vol. 3733 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 927-936
Grubba, Tanja and Weihrauch, Klaus, On computable metrization, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 345-364
Grubba, Tanja and Weihrauch, Klaus and Xu, Yatao, Effectivity on Continuous Functions in Topological Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 237-254
Grzegorczyk, Andrzej, Undecidability of some topological theories, Fund. Math.38 (1951) 137-152
Grzegorczyk, Andrzej, On the definition of computable functionals, Fundamenta Mathematicae42 (1955) 232-239
Grzegorczyk, Andrzej, On the definitions of computable real continuous functions, Fundamenta Mathematicae44 (1957) 61-71
Grzegorczyk, Andrzej, Some approaches to constructive analysis, in: Heyting, A. (ed.), Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pages 43-61
Grzegorczyk, Andrzej, Mathematical and empirical verifiability, in: Twenty-five Years of logic. Methodol. in Poland, 1977, pages 165-169
Gu, Xiaoyang and Lutz, Jack H., Effective dimensions and relative frequencies, in: Logic and theory of algorithms, vol. 5028 of Lecture Notes in Comput. Sci., Springer, Berlin, 2008, pages 231-240
Gu, Xiaoyang and Lutz, Jack H. and Mayordomo, Elvira, Points on computable curves, in: 47th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, 2006, pages 469-474
Gu, Xiaoyang and Lutz, Jack H. and Mayordomo, Elvira, Curves that must be retraced, Information and Computation209:6 (2011) 992-1006
Gärtner, Tobias and Hotz, Günter, Recursive Analytic Functions of a Complex Variable, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 81-97
Gács, Peter and Hoyrup, Mathieu and Rojas, Cristóbal, Randomness on computable probability spaces–a dynamical point of view, in: Susanne Albers and Jean-Yves Marion (eds.), STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science, vol. 3 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2009, pages 469-480
Gács, Peter, Uniform test of algorithmic randomness over a general space, Theoretical Computer Science341 (2005) 91-137
Hainry, Emmanuel, Modèles de calcul sur les réels résultats de comparaisons, PhD thesis, l'Institut National Polytechnique de Lorraine, 2006
Hajime Ishihara and Satoru Yoshida, A constructive look at the completeness of the space D (\textbfR), Journal of Symbolic Logic67:4 (2002) 1511–1519
Harrison, John, Constructing the real numbers in HOL, in: Higher order logic theorem proving and its applications (Leuven, 1992), IFIP Trans. A Comput. Sci. Tech., A-20, North-Holland, Amsterdam, 1993, pages 145-164
Hauck, Jürgen, Ein Kriterium für die Annahme des Maximums in der Berechenbaren Analysis, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik17 (1971) 193-196
Hauck, Jürgen, Zur Präzisierung des Begriffes berechenbare reelle Funktion, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik17 (1971) 295-300
Hauck, Jürgen, Funktional-Rekursion, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik18 (1972) 31-36
Hauck, Jürgen, Berechenbare gleichmäßige Stetigkeit in der konstruktiven Analysis von Klaua, Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin Math.-Nat. R.21:5 (1972) 523-526
Hauck, Jürgen, Berechenbare gleichmäßige Finitheit rekursiver Funktionale, Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin Math.-Nat. R.21:5 (1972) 527-529
Hauck, Jürgen, Berechenbare reelle Funktionen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik19 (1973) 121-140
Hauck, Jürgen, Turingmaschinen und berechenbare reelle Funktionen, Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin Math.-Nat. R.24:6 (1975) 797-798
Hauck, Jürgen, Iterationsverfahren in der konstruktiven Analysis, Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin Math.-Nat. R.24:6 (1975) 799-800
Hauck, Jürgen, Berechenbare reelle Funktionenfolgen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik22 (1976) 265-282
Hauck, Jürgen, Zum Zwischenwertsatz in der konstruktiven Analysis, Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin Math.-Nat. R.26:5 (1977) 623-627
Hauck, Jürgen, Rekursive Funktionale und der Fixpunksatz von Banach, Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin Math.-Nat. R.26:5 (1977) 635-636
Hauck, Jürgen, Konstruktive Darstellungen reeller Zahlen und Folgen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik24 (1978) 365-374
Hauck, Jürgen, Stetigkeitseigenschaften berechenbarer reeller Funktionen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik26 (1980) 69-76
Hauck, Jürgen, Konstruktive Darstellungen in topologischen Räumen mit rekursiver Basis, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik26 (1980) 565-576
Hauck, Jürgen, Berechenbarkeit in topologischen Räumen mit rekursiver Basis, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik27 (1981) 473-480
Hauck, Jürgen, Stetigkeitseigenschaften berechenbarer Funktionale, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik28 (1982) 377-383
Hauck, Jürgen, Konstruktive reelle Funktionale und Operatoren, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik29 (1983) 213-218
Hauck, Jürgen, Eine neue Definition berechenbarer reeller Funktionen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik30 (1984) 259-268
Hauck, Jürgen, Zur Wellengleichung mit konstruktiven Randbedingungen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik30 (1984) 561-566
Hauck, Jürgen, Ein Kriterium für die konstruktive Lösbarkeit der Differentialgleichung y'=f(x,y), Zeitschrift für Mathematische Logik und Grundlagen der Mathematik31 (1985) 357-362
Hauck, Jürgen, Eine berechenbare Funktion mit rationalen Werten, die nicht rekursiv ist, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik33 (1987) 255-256
Havea, Robin Siale, Constructive Spectral and Numerical Range Theory, PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2001
Havea, Robin Siale, On Firmness of the State Space and Positive Elements of a Banach Algebra, Journal of Universal Computer Science11:12 (2005) 1963-1969
Heckmann, Reinhold, Contractivity of linear fractional transformations, Theoretical Computer Science279 (2002) 65-82
Heindl, Gerhard and Kreinovich, Vladik and Rifqi, Maria, In Case of Interval (or More General) Uncertainty, No Algorithm Can Choose the Simplest Representative, Reliable Computing8 (2002) 213-227
Hemmerling, Armin, On the Time Complexity of Partial Real Functions, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 31-40
Hemmerling, Armin, On Approximative and Algebraic Computability over the Real Numbers, Theoretical Computer Science219 (1999) 185-223
Hemmerling, Armin, Berechenbarkeit über den reellen Zahlen, der approximative und der algebraische Zugang, in: Flachsmeyer, Jürgen and Fritsch, Rudolph and Reichel, Hans-Christian (eds.), Mathematik-interdisziplinär, Shaker Verlag, Aachen, 2000, pages 167-176
Hemmerling, Armin, On the Time Complexity of Partial Real Functions, Journal of Complexity16 (2000) 363-376
Hemmerling, Armin, Standard Representations of Effective Metric Spaces, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 48-68
Hemmerling, Armin, Effective metric spaces and representations of the reals, Theoretical Computer Science284:2 (2002) 347-372
Hemmerling, Armin, Characterizations of the class Δ_2^ta over Euclidean spaces, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 241-254
Hemmerling, Armin, The discrete parts of approximately decidable sets in Euclidean spaces, Mathematical Logic Quarterly49:4 (2003) 428-432
Hemmerling, Armin, Characterizations of the class Δ_2^ta over Euclidean spaces, Mathematical Logic Quarterly50:4,5 (2004) 507-519
Hemmerling, Armin, Hierarchies of Function Classes Defined by the First-Value Operator (Extended Abstract), in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 59-72
Hendtlass, Matthew, Constructing fixed points and economic equilibria, Ph.D. thesis, Department of Pure Mathematics, University of Leeds, Leeds, UK, 2013
Hendtlass, Matthew and Schuster, Peter, A direct proof of Wiener's theorem, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 293-302
Hertling, Peter, Disjunctive Omega-words und real numbers, Journal of Universal Computer Science2:7 (1996) 549-568
Hertling, Peter, Unstetigkeitsgrade von Funktionen in der effektiven Analysis, Dissertation, Fachbereich Informatik, FernUniversität Hagen, 1996
Hertling, Peter, Effectivity and Effective Continuity of Functions between Computable Metric Spaces, in: Bridges, Douglas S. and Calude, Cristian S. and Gibbons, Jeremy and Reeves, Steve and Witten, Ian H. (eds.), Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pages 264-275
Hertling, Peter, Surjective Functions on Computably Growing Cantor Sets, Journal of Universal Computer Science3:11 (1997) 1226-1240
Hertling, Peter, Standard Representations of Real Numbers, Chaos, Solitons & Fractals10:6 (1999) 1087-1101
Hertling, Peter, A Real Number Structure that is Effectively Categorical, Mathematical Logic Quarterly45:2 (1999) 147-182
Hertling, Peter, Banach-Mazur Computable Functions on Metric Spaces, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 69-81
Hertling, Peter, A Comparison of Certain Representations of Regularly Closed Sets, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Hertling, Peter, A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers, in: Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy, Matthew and Eidenbenz, Stephan and Conejo, Ricardo (eds.), Automata, Languages and Programming, vol. 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 962-972
Hertling, Peter, Topological Complexity of Zero Finding with Algebraic Operations, Journal of Complexity18:4 (2002) 912-942
Hertling, Peter, Topological complexity of zero finding for continuous functions (Abstract), in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, page 13
Hertling, Peter, Is the Mandelbrot set computable?, Mathematical Logic Quarterly51:1 (2005) 5-18
Hertling, Peter and Selivanov, Victor, Complexity issues for preorders on finite labeled forests, in: Löwe, Benedikt and Normann, Dag and Soskov, Ivan and Soskova, Alexandra (eds.), Models of computation in context, vol. 6735 of Lecture Notes in Computer Science, Springer, Heidelberg, 2011, pages 112-121
Hertling, Peter and Selivanov, Victor, Complexity issues for preorders on finite labeled forests, in: Brattka, Vasco and Diener, Hannes and Spreen, Dieter (eds.), Logic, Computation, Hierarchies, Ontos Mathematical Logic, Walter de Gruyter, Boston, 2014, pages 165-190
Hertling, Peter and Spandl, Christoph, Computability theoretic properties of the entropy of gap shifts, Fundamenta Informaticae83:1-2 (2008) 141-157
Hertling, Peter and Spandl, Christoph, Shifts with decidable language and non-computable entropy, Discrete Mathematics and Theoretical Computer Science10:3 (2008) 75-93
Hertling, Peter and Weihrauch, Klaus, Levels of degeneracy and exact lower complexity bounds for geometric algorithms, in: Proceedings of the Sixth Canadian Conference on Computational Geometry, 1994, pages 237-242
Hertling, Peter and Weihrauch, Klaus, Randomness Spaces, in: Kim G. Larsen and Sven Skyum and Glynn Winskel (eds.), Automata, Languages and Programming, vol. 1443 of Lecture Notes in Computer Science, Springer, Berlin, 1998, pages 796-807
Hertling, Peter and Weihrauch, Klaus, Random elements in effective topological spaces with measure, Information and Computation181:1 (2003) 32-56
Heyting, A., Note on the Riesz-Fischer theorem, Indagationes Mathematicae13 (1951) 35-40
Heyting, A., Intuitionism: An Introduction, North-Holland, Amsterdam, 1956
Higuchi, Kojiro, P_w is not a Heyting algebra, in: Programs, proofs, processes, vol. 6158 of Lecture Notes in Comput. Sci., Springer, Berlin, 2010, pages 190-194
Higuchi, Kojiro, Degree Structures of Mass Problems and Choice Functions, PhD thesis, Mathematical Institute, Tohoku University, Sendai, Japan, 2012
Higuchi, Kojiro and Kihara, Takayuki, Effective strong nullness and effectively closed sets, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 303-312
Hiroshima, Keita and Kawamura, Akitoshi, Elementarily Traceable Irrational Numbers, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 135-140
Hirowatari, Eiju and Arikawa, Setsuo, A comparison of identification criteria for inductive inference of recursive real-valued functions, Theoretical Computer Science268 (2001) 351-366
Hirsch, Michael David, Applications of topology to lower bound estimates in computer science, Ph.D. thesis, University of California, Berkeley, 1990
Hirschfeldt, Denis R., Some Questions in Computable Mathematics, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 22-55
Hirschfeldt, Denis R. and Terwijn, Sebastiaan A., Limit computability and constructive measure, in: Computational prospects of infinity. Part II. Presented talks, vol. 15 of Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap., World Sci. Publ., Hackensack, NJ, 2008, pages 131-141
Hirst, Jeffry L. and Mummert, Carl, Reverse Mathematics of Matroids, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 143-159
Hirst, Jeffry L. and Mummert, Carl, Using Ramsey's theorem once, Archive for Mathematical Logic58:7-8 (2019) 857-866
Hirvonen, Asa and Kontinen, Juha and Pauly, Arno, Continuous Team Semantics, in: Gopal, T.V. and Watada, Junzo (eds.), Theory and Applications of Models of Computation, vol. 11436 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 262-278
Hitchcock, John M., Correspondence Principles for Effective Dimensions, in: Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy, Matthew and Eidenbenz, Stephan and Conejo, Ricardo (eds.), Automata, Languages and Programming, vol. 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 561-572
Hitchcock, John M. and Lutz, Jack H., Why Computational Complexity Requires Stricter Martingales, in: Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy, Matthew and Eidenbenz, Stephan and Conejo, Ricardo (eds.), Automata, Languages and Programming, vol. 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 549-560
Hoover, H. James, Feasible Constructive Analysis, PhD thesis, Dept. of Computer Science, University of Toronto, Toronto, Canada, 1987
Hoover, H. James, Why integration is hard, in: Kaltofen, Erich and Watt, Stephen M. (eds.), Computers and mathematics, Springer, 1989, pages 172-181
Hoover, H. James, Feasible real functions and arithmetic circuits, SIAM Journal on Computing19:1 (1990) 182-204
Hoover, H. James, Real functions, contraction mappings, and P-completeness, Information and Computation93:2 (1991) 333-349
Hoover, H. James, Computational models for feasible real analysis, in: Buss, Samuel R. and Scott, Philip J. (eds.), Feasible mathematics, vol. 9 of Progress in Computer Science and Applied Logic, Birkhäuser, 1993, pages 221-237
Horvat, Marko and Iljazović, Zvonko and Pažek, Bojan, Computability of pseudo-cubes, Annals of Pure and Applied Logic171:8 (2020) 102823
Hou, Tie, Coinductive Proofs for Basic Real Computation, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 221-230
Hoyrup, Mathieu, Randomness and the ergodic decomposition, in: Benedikt Löwe and Dag Normann and Ivan N. Soskov and Alexandra A. Soskova (eds.), Models of Computation in Context, vol. 6735 of Lecture Notes in Computer Science, Springer, Heidelberg, 2011, pages 122-131
Hoyrup, Mathieu, The dimension of ergodic random sequences, in: Christoph Dürr and Thomas Wilke (eds.), 29th International Symposium on Theoretical Aspects of Computer Science, vol. 14 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2012, pages 567-576
Hoyrup, Mathieu, Irreversible computable functions, in: Ernst W. Mayr and Natacha Portier (eds.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), vol. 25 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2014, pages 362-373
Hoyrup, Mathieu, The Typical Constructible Object, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 115-123
Hoyrup, Mathieu, The decidable properties of subrecursive functions, in: 43rd International Colloquium on Automata, Languages, and Programming, vol. 55 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2016, page Art. No. 108, 13
Hoyrup, Mathieu, Topological analysis of representations, in: Sailing routes in the world of computation, vol. 10936 of Lecture Notes in Computer Science, Springer, Cham, 2018, pages 214-223
Hoyrup, Mathieu, Descriptive Complexity on Non-Polish Spaces II, in: Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela (eds.), 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), vol. 168 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pages 132:1-132:17
Hoyrup, Mathieu, Algorithmic randomness and layerwise computability, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 115-133
Hoyrup, Mathieu and Gomaa, Walid, On the extension of computable real functions, in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, Piscataway, NJ, 2017, page 12
Hoyrup, Mathieu and Kihara, Takayuki and Selivanov, Victor, Degrees of Non-computability of Homeomorphism Types of Polish Spaces, in: Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno (eds.), Beyond the Horizon of Computability, Springer International Publishing, Cham, 2020, pages 189-192
Hoyrup, Mathieu and Nava Saucedo, Diego and Stull, Don M., Semicomputable geometry, in: 45th International Colloquium on Automata, Languages, and Programming, vol. 107 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., 2018, page Art. No. 129, 13
Hoyrup, Mathieu and Rojas, Cristóbal and Selivanov, Victor and Stull, Donald M., Computability on quasi-Polish spaces, in: Descriptional complexity of formal systems, vol. 11612 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 171-183
Hoyrup, Mathieu and Rojas, Cristóbal, Applications of effective probability theory to Martin-Löf randomness, in: Susanne Albers and Alberto Marchetti-Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas (eds.), Automata, Languages and Programming. Part I, vol. 5555 of Lecture Notes in Comput. Sci., Springer, Berlin, 2009, pages 549-561
Hoyrup, Mathieu and Rojas, Cristóbal, An application of Martin-Löf randomness to effective probability theory, in: Klaus Ambos-Spies and Benedikt Löwe and Wolfgang Merkle (eds.), Mathematical Theory and Computational Practice, vol. 5635 of Lecture Notes in Computer Science, Springer, Berlin, 2009, pages 260-269
Hoyrup, Mathieu and Rojas, Cristóbal, On the Information Carried by Programs about the Objects They Compute, in: Mayr, Ernst W. and Ollinger, Nicolas (eds.), 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), vol. 30 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015, pages 447-459
Hoyrup, Mathieu and Rojas, Cristóbal and Weihrauch, Klaus, Computability of the Radon-Nikodym derivative, in: Löwe, Benedikt and Normann, Dag and Soskov, Ivan and Soskova, Alexandra (eds.), Models of Computation in Context, vol. 6735 of Lecture Notes in Computer Science, Springer, Heidelberg, 2011, pages 132-141
Hoyrup, Mathieu and Rute, Jason, Computable Measure Theory and Algorithmic Randomness, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 227-270
Hoyrup, Mathieu and Stull, Donald M., Semicomputable Points in Euclidean Spaces, in: Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter (eds.), 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), vol. 138 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2019, pages 48:1-48:13
Huang, Xiang and Klinge, Titus H and Lathrop, James I and Li, Xiaoyuan and Lutz, Jack H, Real-Time Computability of Real Numbers by Chemical Reaction Networks, in: International Conference on Unconventional Computation and Natural Computation, 2017, pages 29-40
Huang, Xiang and Stull, Donald M., Polynomial Space Randomness in Analysis, in: Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf (eds.), 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), vol. 58 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2016, pages 86:1-86:13
Hudes, L., Hyperarithmetical real numbers and hyperarithmetical analysis, PhD thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1962
Hur, Namhyun and Davenport, James H., A Generic Root Operation for Exact Real Arithmetic, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 82-87
Hyland, J.M.E., Filter Spaces and Continuous Functionals, Annals of Mathematical Logic16 (1979) 101-143
Hyland, J.M.E., Application of constructivity, in: Cohen, L.J. and Loś, G. and Pfeiffer, H. and and Podewski, K.-P. (eds.), Methodology and Philos. Sci. VI, vol. 104 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1982, pages 145-152
Iljazović, Zvonko and Takayuki Kihara, Computability of Subsets of Metric Spaces, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 29-69
Ilse, Dieter, Zur Stetigkeit berechenbarer reeller Funktionen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik11 (1965) 297-342
Iris Loeb, Equivalents of the (Weak) Fan Theorem, Annals of Pure and Applied Logic132:1 (2005) 51-66
Ishihara, Hajime, Constructive reflexivity of a uniformly convex Banach space, Proc. Amer. Math. Soc.104:3 (1988) 735-740
Ishihara, Hajime, On the constructive Hahn-Banach theorem, Bull. London Math. Soc.21:1 (1989) 79-81
Ishihara, Hajime, Constructive compact linear mappings, Bull. London Math. Soc.21 (1989) 577-584
Ishihara, Hajime, An omniscience principle, the König lemma and the Hahn-Banach theorem, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik36 (1990) 237-240
Ishihara, Hajime, Boundedness, normability and compactness of constructive linear mappings, PhD thesis, Tokyo Institute of Technology, Tokyo, 1990
Ishihara, Hajime, Constructive compact operators on a Hilbert space, Annals of Pure and Applied Logic52 (1991) 31-37
Ishihara, Hajime, Continuity and nondiscontinuity in constructive mathematics, The Journal of Symbolic Logic56:4 (1991) 1349-1354
Ishihara, Hajime, Continuity properties in constructive mathematics, The Journal of Symbolic Logic57:2 (1992) 557-565
Ishihara, Hajime, Constructive existence of Minkowski functionals, Proc. Amer. Math. Soc.116:1 (1992) 79-84
Ishihara, Hajime, Sequentially Continuity in Constructive Mathematics, in: Calude, C.S. and Dinneen, M.J. and Sburlan, S. (eds.), Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, London, 2001, pages 5-12
Ishihara, Hajime, Locating subsets of a Hilbert space, Proceedings of the American Mathematical Society129 (2001) 1385-1390
Ishihara, Hajime, Constructive reverse mathematics: compactness properties, in: Crosilla, Laura and Schuster, Peter (eds.), From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics, Oxford University Press, 2005, pages 245-267
Ishihara, Hajime, Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof, Notre Dame Journal of Formal Logic47:2 (2006) 249-252
Ishihara, Hajime, Unique Existence and Computability in Constructive Reverse Mathematics, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 368-377
Ishihara, Hajime and Mines, Ray and Schuster, Peter and Vîţă, Luminiţa, Quasi-apartness and neighbourhood spaces, Annals of Pure and Applied Logic141:1-2 (2006) 296-306
Jafarikhah, Tahereh and Weihrauch, Klaus, The Riesz representation operator on the dual of C[0;1] is computable, Journal of Universal Computer Science19:6 (2013) 750-770
Jakobsen, Sune Kristian and Simonsen, Jakob Grue, Liouville Numbers and the Computational Complexity of Changing Bases, in: Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno (eds.), Beyond the Horizon of Computability, Springer International Publishing, Cham, 2020, pages 50-62
John Myhill, Constructive Set Theory, The Journal of Symbolic Logic40:3 (1975) 347-382
Julian, William and Richman, Fred, A uniformly continuous function on [0,1] that is everywhere different from its infimum, Pacific Journal of Mathematics111:2 (1984) 333-340
Kalantari, I. and Leggett, A., Simplicity in effective topology, The Journal of Symbolic Logic47 (1982) 169-183
Kalantari, I. and Leggett, A., Maximality in effective topology, The Journal of Symbolic Logic48 (1983) 100-112
Kalantari, I. and Remmel, J.B., Degrees of recursively enumerable topological spaces, The Journal of Symbolic Logic48 (1983) 610-622
Kalantari, I. and Retzlaff, A., Recursive constructions in topological spaces, The Journal of Symbolic Logic44 (1979) 609-625
Kalantari, I. and Weitkamp, G., Effective topological spaces, I. A definability theory, Annals of Pure and Applied Logic29 (1985) 1-27
Kalantari, I. and Weitkamp, G., Effective topological spaces, II. A hierarchy, Annals of Pure and Applied Logic29 (1985) 207-224
Kalantari, I. and Weitkamp, G., Effective topological spaces, III. Forcing and definability, Annals of Pure and Applied Logic36 (1985) 17-27
Kalantari, Iraj, Major subsets in effective topology, in: Metakides, G. (ed.), Patras Logic Symposion, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1982, pages 77-94
Kalantari, Iraj, Density & Baire category in recursive topology, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 15-18
Kalantari, Iraj and Welch, Larry, A blend of methods of recursion theory and topology, Annals of Pure and Applied Logic124:1-3 (2003) 141-178
Kalantari, Iraj and Welch, Larry, Density and Baire category in recursive topology, Mathematical Logic Quarterly50:4,5 (2004) 381-391
Kalantari, Iraj and Welch, Lawrence, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, Annals of Pure and Applied Logic93:1-3 (1998) 125-151
Kalantari, Iraj and Welch, Lawrence, Recursive and nonextendible functions over the reals; filter foundation for recursive analysis, II, Annals of Pure and Applied Logic98:1-3 (1999) 87-110
Kamo, Hiroyasu, Effective Contraction Theorem and Its Application, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 88-100
Kamo, Hiroyasu, Effective Dini's Theorem on Effectively Compact Metric Spaces, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 73-82
Kamo, Hiroyasu, Computability and computable uniqueness of Urysohn's universal metric space, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 149-159
Kamo, Hiroyasu and Kawamura, Kiko, Computability of Self-Similar Sets, Mathematical Logic Quarterly45 (1999) 23-30
Kamo, Hiroyasu and Kawamura, Kiko and Takeuti, Izumi, Hausdorff Dimension and Computational Complexity, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 41-50
Kamo, Hiroyasu and Kawamura, Kiko and Takeuti, Izumi, Computational complexity of fractal sets, Real Analysis Exchange26:2 (2000/01) 773-793
Kanovič, M.I. and Kushner, B.A., Complexity of algorithms, and Specker sequences (Russian), in: Studies in the Theory of Algorithms and Mathematical Logic, Vyčisl. Centr. Akad. Nauk SSSR, 1976, pages 77-63,160
Kapoulas, George, Polynomially Time Computable Functions over p-Adic Fields, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 101-118
Kapron, Bruce M., Feasibly continuous type-two functionals, Computational Complexity8:2 (1999) 188-201
Kapron, Bruce M. and Steinberg, Florian, Type-two iteration with bounded query revision, in: Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, vol. 298 of Electronic Proceedings of Theoretical Computer Science, EPTCS, 2019, pages 61-73
Kashefi, Elham, Quantum domain theory - definitions and applications, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 255-274
Kawamura, Akitoshi, Type-2 Computability and Moore's Recursive Functions, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 83-95
Kawamura, Akitoshi and Cook, Stephen, Complexity theory for operators in analysis, in: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC '10, ACM, New York, 2010, pages 495-502
Kawamura, Akitoshi and Ota, Hiroyuki, Small complexity classes for computable analysis, in: Mathematical foundations of computer science 2014. Part II, vol. 8635 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2014, pages 432-444
Kawamura, Akitoshi and Ota, Hiroyuki and Rösnick, Carsten and Ziegler, Martin, Computational complexity of smooth differential equations, in: Mathematical foundations of computer science 2012, vol. 7464 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2012, pages 578-589
Kawamura, Akitoshi and Pauly, Arno, Function spaces for second-order polynomial time, in: Language, life, limits, vol. 8493 of Lecture Notes in Comput. Sci., Springer, Cham, 2014, pages 245-254
Kawamura, Akitoshi and Steinberg, Florian, Polynomial running times for polynomial-time oracle machines, in: 2nd International Conference on Formal Structures for Computation and Deduction, vol. 84 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2017, page Art. No. 23, 18
Kawamura, Akitoshi and Steinberg, Florian and Thies, Holger, Second-Order Linear-Time Computability with Applications to Computable Analysis, in: Gopal, T.V. and Watada, Junzo (eds.), Theory and Applications of Models of Computation, vol. 11436 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 337-358
Kawamura, Akitoshi and Steinberg, Florian and Ziegler, Martin, Towards Computational Complexity Theory on Advanced Function Spaces in Analysis, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 142-152
Kawamura, Akitoshi and Steinberg, Florian and Ziegler, Martin, Complexity theory of (functions on) compact metric spaces, in: Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016), ACM, New York, 2016, page 10
Kawamura, Akitoshi and Thies, Holger and Ziegler, Martin, Average-case polynomial-time computability of Hamiltonian dynamics, in: 43rd International Symposium on Mathematical Foundations of Computer Science, vol. 117 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2018, page Art. No. 30, 17
Keimel, Klaus, Locally convex cones and the Schröder-Simpson theorem, Quaestiones Mathematicae35 (2012) 353-390
Kelsey, Tom, Exact Numerical Computation via Symbolic Computation, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 187-197
Kenny, Robert, Orbit Complexity and Entropy for Group Endomorphisms, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 97-110
Khalouani, Mohamed and Labhalla, Salah and Lombardi, Henri, Étude constructive de problèmes de topologie pour les réels irrationnels, Mathematical Logic Quarterly45:2 (1999) 257-288
Khanban, Ali Asghar and Edalat, Abbas and Lieutier, André, Computability of Delaunay Triangulation and Voronoi Diagram, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Kieu, Tien D., Mathematical computability questions for some classes of linear and non-linear differential equations originated from Hilbert's Tenth Problem, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 161-168
Kihara, Takayuki, Effectively closed sets and degrees of unsolvability, PhD thesis, Mathematical Institute, Tohoku University, 2011
Kihara, Takayuki, A hierarchy of immunity and density for sets of reals, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 384-394
Kihara, Takayuki and Pauly, Arno, Dividing by Zero - How Bad Is It, Really?, in: Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf (eds.), 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), vol. 58 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2016, pages 58:1-58:14
Kihara, Takayuki and Pauly, Arno, Dividing by zero–how bad is it, really?, in: 41st International Symposium on Mathematical Foundations of Computer Science, vol. 58 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2016, page Art. No. 58, 14
Kihara, Takayuki and Pauly, Arno, Finite choice, convex choice and sorting, in: Gopal, T.V. and Watada, Junzo (eds.), Theory and applications of models of computation, vol. 11436 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 378-393
Kihara, Takayuki and Pauly, Arno, De Groot Duality for Represented Spaces, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 89-101
Kjos-Hanssen, Bjørn, The probability distribution as a computational resource for randomness testing, Journal of Logic and Analysis2 (2010) Paper 10, 13
Kjos-Hanssen, Bjørn and Nies, André and Stephan, Frank, On a question of Ambos-Spies and Kučera, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 275-278
Kjos-Hanssen, Bjørn and Webb, David J., KL-Randomness and Effective Dimension Under Strong Reducibility, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 457-468
Klaua, Dieter, Berechenbare Analysis, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik2 (1956) 265-303
Klaua, Dieter, Die Präzisierung des Berechenbarkeitsbegriffes in der Analysis mit Hilfe rationaler Funktionale, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik5 (1959) 33-96
Klaua, Dieter, Berechenbare Reihen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik6 (1960) 143-161
Klaua, Dieter, Konstruktive Analysis, Deutscher Verlag der Wissenschaften, Berlin, 1961
Klaua, Dieter, Rational and real ordinal numbers, in: Real Numbers, Generalizations of the Reals, and Theories of Continua, vol. 242 of Synthese Lib., 1994, pages 259-276
Kleene, Stephen C. and Vesli, R., The foundations of intuitionistic mathematics. Especially in relation to recursive functions., Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1965
Ko, Ker-I, The maximum value problem and NP real numbers, Journal of Computer and Systems Sciences24 (1982) 15-35
Ko, Ker-I, Some negative results on the computational complexity of total variation and differentiation, Inform. Contr.53 (1982) 21-31
Ko, Ker-I, On the computational complexity of ordinary differential equations, Inform. Contr.58 (1983) 157-194
Ko, Ker-I, On the definitions of some complexity classes of real numbers, Math. Systems Theory16 (1983) 95-109
Ko, Ker-I, Reducibilities on real numbers, Theoretical Computer Science31 (1984) 101-123
Ko, Ker-I, Continuous optimization problems and a polynomial hierarchy of real functions, Journal of Complexity1 (1985) 210-231
Ko, Ker-I, Approximation to measurable functions and its relation to probabilistic computation, Annals of Pure and Applied Logic30 (1986) 173-200
Ko, Ker-I, On the computational complexity of best Chebyshev approximations, Journal of Complexity2 (1986) 95-120
Ko, Ker-I, On the continued fraction representation of computable real numbers, Theoretical Computer Science47 (1986) 299-313
Ko, Ker-I, Inverting a one-to-one real function is inherently sequential, in: Buss, S. and Scott, P.J. (eds.), Feasible Mathematics, 1990, pages 239-257
Ko, Ker-I, Complexity Theory of Real Functions, Progress in Theoretical Computer Science, Birkhäuser, Boston, 1991
Ko, Ker-I, On the computational complexity of integral equations, Annals of Pure and Applied Logic58 (1992) 201-228
Ko, Ker-I, Recent progress on complexity theory of real functions, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 83-90
Ko, Ker-I, A polynomial-time computable curve whose interior has a nonrecursive measure, Theoretical Computer Science145 (1995) 241-270
Ko, Ker-I, Computational complexity of fixed points and intersection points, Journal of Complexity11 (1995) 265-292
Ko, Ker-I, Fractals and complexity, in: Ko, Ker-I and Müller, Norbert and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Universität Trier, 1996, pages 43-48
Ko, Ker-I, Polynomial-Time Computability in Analysis, in: Ershov, Yu. L. and Goncharov, S.S. and Nerode, A. and Remmel, J.B. (eds.), Handbook of Recursive Mathematics, vol. 139 of Studies in Logic and the Foundations of Mathematics, Elsevier, Amsterdam, 1998, pages 1271-1317
Ko, Ker-I, On the computability of fractal dimensions and Hausdorff measure, Annals of Pure and Applied Logic93 (1998) 195-216
Ko, Ker-I, Computational Complexity of Fractals, in: Downey, Rod and Decheng, Ding and Ping, Tung Shih and Hui, Qiu Yu and Yasugi, Mariko (eds.), Proceedings of the 7th and 8th Asian Logic Conferences, World Scientific, Singapore, 2003, pages 252-269
Ko, Ker-I and Friedman, H., Computational complexity of real functions, Theoretical Computer Science20 (1982) 323-352
Ko, Ker-I and Friedman, H., Computing power series in polynomial time, Advances in Applied Math.9 (1988) 40-50
Ko, Ker-I and Nerode, Anil and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 284(2) of Theoretical Computer Science, Elsevier, Amsterdam, 2002
Ko, Ker-I and Weihrauch, Klaus, On the measure of two-dimensional regions with polynomial-time computable boundaries, in: Homer, Steve and Cai, Jin-Yi (eds.), Eleventh Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, 1996, pages 150-159
Ko, Ker-I and Yu, Fuxiang, Jordan Curves with Polynomial Inverse Moduli of Continuity, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 425-447
Ko, Ker-I and Yu, Fuxiang, On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 121-135
Kohlenbach, Ulrich, Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallé Poussin's proof for Chebycheff approximation, Annals of Pure and Applied Logic64 (1993) 27-94
Kohlenbach, Ulrich, New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory, Numer. Funct. Anal. and Optimiz.14 (1993) 581-606
Kohlenbach, Ulrich, Analysing Proofs in Analysis, in: Hodges, Wilfried and Hyland, Martin and Steinhorn, Charles and Truss, John (eds.), Logic: from Foundations to Applications, Clarendon Press, Oxford, 1996, pages 225-260
Kohlenbach, Ulrich, Arithmetizing proofs in analysis, in: Larrazabal, J.M. and Lascar, D. and Mints, G. (eds.), Logic Colloquium '96, vol. 12 of Lecture Notes in Logic, Springer, Berlin, 1997, pages 115-158
Kohlenbach, Ulrich, Proof theory and computational analysis, Electronic Notes in Theoretical Computer Science13 (1998) 1-34
Kohlenbach, Ulrich, The use of a logical principle of uniform boundedness in analysis, in: Cantini, A. and Casari, E. and Minari, P. (eds.), Logic and Foundations of Mathematics, vol. 280 of Synthese Library, Kluwer Academic Publishers, 1999, pages 93-106
Kohlenbach, Ulrich, Things that can and things that cannot be done in PRA, Annals of Pure and Applied Logic102 (2000) 223-245
Kohlenbach, Ulrich, On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 119-145
Kohlenbach, Ulrich, A quantitative version of a theorem due to Borwein-Reich-Shafrir, Numerical Functional Analysis and Optimization22:5 (2001) 641-656
Kohlenbach, Ulrich, On uniform weak König's lemma, Annals of Pure and Applied Logic114 (2002) 103-116
Kohlenbach, Ulrich, Uniform asymptotic regularity for Mann iterates, Journal of Mathematical Analysis and Applications279 (2003) 531-544
Kohlenbach, Ulrich, Higher order reverse mathematics, in: Simpson, Stephen G. (ed.), Reverse Mathematics 2001, vol. 21 of Lecture Notes in Logic, A K Peters, Wellesley, 2005, pages 281-295
Kohlenbach, Ulrich, Some logical metatheorems with applications in functional analysis, Transactions of the American Mathematical Society357 (2005) 89-128
Kohlenbach, Ulrich, Some computational aspects of metric fixed point theory, Nonlinear Analysis61 (2005) 823-837
Kohlenbach, Ulrich, Proof interpretations and the computational content of proofs in mathematics, Bulletin of the EATCS93 (2007) 143-173
Kohlenbach, Ulrich, Effective bounds from proofs in abstract functional analysis, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), New Computational Paradigms: Changing Conceptions of What Is Computable, Springer, New York, 2008, pages 223-258
Kohlenbach, Ulrich, Applied Proof Theory: Proof Interpretations and Their Use in Mathematics, Springer, Berlin, 2008
Kohlenbach, Ulrich, On the logical analysis of proofs based on nonseparable Hilbert space theory, in: Proofs, categories and computations, vol. 13 of Tributes, Coll. Publ., London, 2010, pages 131-143
Kohlenbach, Ulrich and Lambov, Branimir, Bounds on iterations of asymptotically quasi-nonexpansive mappings, in: Falset, J.G. and Fuster, E.L. and Sims, B. (eds.), Proceedings of the International Conference on Fixed Point Theory and Applications, Yokohama Publishers, 2004, pages 143-172
Kohlenbach, Ulrich and Leuçtean, Laurenţiu, Mann iterates of directionally nonexpansive mappings in hyperbolic spaces, Abstract and Applied Analysis2003:8 (2003) 449-477
Kohlenbach, Ulrich and Leuçtean, Laurenţiu, The approximate fixed point property in product spaces, Nonlinear Analysis66 (2007) 806-818
Kohlenbach, Ulrich and Oliva, Paulo, Proof mining in L_1-approximation, Annals of Pure and Applied Logic121 (2003) 1-38
Koiran, Pascal and Moore, Christopher, Closed-form analytic maps in one and two dimensions can simulate universal Turing machines, Theoretical Computer Science219 (1999) 217-223
Kolmogorov, Andrei N., On the principle of tertium non datur (Russian), Mat. Sb.32 (1925) 646-667
Konečný, Michal and Park, Sewon and Thies, Holger, Axiomatic reals and certified efficient exact real computation, in: Logic, language, information, and computation, vol. 13038 of Lecture Notes in Comput. Sci., Springer, Cham, 2021, pages 252-268
Konečný, Michal and Park, Sewon and Thies, Holger, Formalizing hyperspaces for extracting efficient exact real computation, in: 48th International Symposium on Mathematical Foundations of Computer Science, vol. 272 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2023, page Art. No. 59, 16
Konečný, Michal and Steinberg, Florian and Thies, Holger, Computable analysis for verified exact real computation, in: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 182 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2020, page Art. No. 50, 18
Konečný, Michal, Many-Valued Real Functions Computable by Finite Transducers using IFS-Representations, PhD thesis, School of Computer Science, University of Birmingham, Birmingham, 2000
Konečný, Michal, Real functions computable by finite automata using affine representations, Theoretical Computer Science284:2 (2002) 373-396
Konečný, Michal, Real functions incrementally computable by finite automata, Theoretical Computer Science315 (2004) 109-133
Konečný, Michal and Steinberg, Florian and Thies, Holger, Continuous and Monotone Machines, in: Esparza, Javier and Král', Daniel (eds.), 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), vol. 170 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pages 56:1-56:16
Korovina, M.V., Generalized computability of real functions, Siberian Advances in Mathematics2:4 (1992) 85-103
Korovina, M.V. and Kudinov, O.V., Majorant-computability and definability over the reals, in: Chesneaux, J.-M. and Jézéquel, F. and Lamotte, J.-L. and Vignes, J. (eds.), Third Real Numbers and Computers Conference, Université Pierre et Marie Curie, Paris, 1998, pages 61-80
Korovina, M.V. and Kudinov, O.V., A new approach to computability over the reals, Siberian Advances in Mathematics8:3 (1998) 59-73
Korovina, M.V. and Kudinov, O.V., Some properties of majorant-computability, in: Arslanov, Marat M. and Lempp, Steffen (eds.), Recursion Theory and Complexity, vol. 2 of Logic and Its Applications, de Gruyter, Berlin, 1999, pages 97-114
Korovina, M.V. and Kudinov, O.V., Characteristic properties of majorant-computability over the reals, in: Gottlob, Georg and Grandjean, Etienne and Seyr, Katrin (eds.), Computer Science Logic, vol. 1584 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pages 188-203
Korovina, Margarita and Kudinov, Oleg, Towards Computability of Higher Type Continuous Data, in: Cooper, Barry S. and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 235-241
Korovina, Margarita and Kudinov, Oleg, Towards Computability over Effectively Enumerable Topological Spaces, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 115-125
Korovina, Margarita and Kudinov, Oleg, Rice's Theorem in Effectively Enumerable Topological Spaces, in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 226-235
Korovina, Margarita and Kudinov, Oleg, Index sets as a measure of continuous constraint complexity, in: Voronkov, Andrei and Virbitskaite, Irina (eds.), Perspectives of system informatics, vol. 8974 of Lecture Notes in Computer Science, Springer, Heidelberg, 2015, pages 201-215
Korovina, Margarita and Kudinov, Oleg, On Higher Effective Descriptive Set Theory, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 282-291
Korovina, Margarita and Kudinov, Oleg, Outline of Partial Computability in Computable Topology, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 64-76
Korovina, Margarita and Kudinov, Oleg, The Rice-Shapiro theorem in computable topology, Logical Methods in Computer Science13:4 (2017) Paper No. 30, 13
Korovina, Margarita and Kudinov, Oleg, Weak Reduction Principle and Computable Metric Spaces, in: Manea, Florin and Miller, Russell G. and Nowotka, Dirk (eds.), Sailing Routes in the World of Computation, Springer, Cham, 2018, pages 234-243
Korovina, Margarita V., Fixed Points on the Real Numbers without the Equality Test, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Korovina, Margarita V. and Kudinov, Oleg V., Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 146-168
Korovina, Margarita V. and Kudinov, Oleg V., Semantic Characterisations of Second-Order Computability over the Real Numbers, in: Fribourg, Laurent (ed.), Computer Science Logic, vol. 2142 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 160-172
Kreinovich, V., Negative results of computable analysis disappear if we restrict ourselves to random (or, more generally, typical) inputs, in: Mathematical structures and modeling. Number 25 (Russian), Omsk. Gos. Univ., Omsk, 2012, pages 100-113, 131
Kreinovich, Vladik and Longpré, Luc, Computational complexity and feasibility of data processing and interval computations, with extension to cases when we have partial information about probabilities, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 19-54
Kreinovich, Vladik and Longpré, Luc, Fast quantum algorithms for handling probabilistic and interval uncertainty, Mathematical Logic Quarterly50:4,5 (2004) 405-416
Kreisel, G., Interpretation of analysis by means of constructive functionals of finite types, in: Heyting, A. (ed.), Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pages 101-128
Kreisel, G., Foundations of Intuitionistic Logic, Methodology and Philisophy of Science, in: Logic, Methodology, and Philosophy of Science, 1962, pages 198-210
Kreisel, G., Church's thesis: A kind of reducibility axiom for constructive mathematics, in: Kino, A. and Myhill, J. and Vesley, R.E. (eds.), Intuitionism and Proof Theory, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1970, pages 121-150
Kreisel, G., Perspectives in the philosophy of pure mathematics, in: Suppes, P. and Henkin, L. and Joja, A. and Moisil, Gr.C. (eds.), Logic, Methodology, and Philosophy of Science VI, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1973, pages 255-277
Kreisel, G., Reviews: Pour-El and Richards 'A computable differential equation which possesses no computable solution' (1979), and 'The wave equation, with computable initial data such that its unique solution' (1981), The Journal of Symbolic Logic47 (1982) 900-902
Kreisel, G., Mathematical logic: tool and object lesson for science. The present state of the problem of foundations of mathematics, Florence, 1981, Synthese Lib.62 (1985) 139-151
Kreisel, G. and Lacombe, D. and Shoenfield, J.R., Fonctionnelles récursivement définissables et fonctionnelles récursives, C.R. Acad. Sci. Paris245 (1957) 399-402
Kreisel, G. and Lacombe, D. and Shoenfield, J.R., Partial recursive functionals and effective operations, in: Heyting, A. (ed.), Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pages 290-297
Kreisel, G. and Macintyre, A., Constructive logic versus algebraization, I, in: Troelstra, A.S. and van Dalen, D. (eds.), The L. E. J. Brouwer Centenary Sympos., vol. 110 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1982, pages 217-260
Kreisel, G. and Putnam, H., Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül, Arch. Math. Logic Grundlag3 (1957) 74-78
Kreisel, G. and Troelstra, A.S., Formal systems for some branches of intuitionistic analysis, Ann. Math. Logic1 (1970) 229-387
Kreisel, Georg, On the interpretation of non-finitist proofs. II. Interpretation of number theory. Applications, The Journal of Symbolic Logic17 (1952) 43-58
Kreisel, Georg and Lacombe, Daniel, Ensembles récursivement mesurables et ensembles récursivement ouverts et fermés, Comptes Rendus Académie des Sciences Paris245 (1957) 1106-1109
Kreitz, Christoph, Theorie der Darstellungen und ihre Anwendungen in der konstruktiven Analysis, PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984
Kreitz, Christoph and Weihrauch, Klaus, Complexity theory on real numbers and functions, in: Cremers, A.B. and Kriegel, H.P. (eds.), Theoretical Computer Science, vol. 145 of Lecture Notes in Computer Science, Springer, 1983
Kreitz, Christoph and Weihrauch, Klaus, A unified approach to constructive and recursive analysis, in: Richter, M.M. and Börger, E. and Oberschelp, W. and Schinzel, B. and Thomas, W. (eds.), Computation and Proof Theory, vol. 1104 of Lecture Notes in Mathematics, Springer, Berlin, 1984, pages 259-278
Kreitz, Christoph and Weihrauch, Klaus, Towards a theory of representations, in: Wechsung, G. (ed.), Frege Conference 1984, Akademie-Verlag, Berlin, 1984, pages 73-79
Kreitz, Christoph and Weihrauch, Klaus, Theory of representations, Theoretical Computer Science38 (1985) 35-53
Kreitz, Christoph and Weihrauch, Klaus, Compactness in constructive analysis revisited, Annals of Pure and Applied Logic36 (1987) 29-38
Kristiansen, Lars and Simonsen, Jakob Grue, On the Complexity of Conversion Between Classic Real Number Representations, in: Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno (eds.), Beyond the Horizon of Computability, Springer International Publishing, Cham, 2020, pages 75-86
Krupski, Vladimir N., Effective simultaneous approximability of reals, Theoretical Computer Science284:2 (2002) 397-417
Krznarić, Marko, Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 169-186
Kudinov, Oleg V. and Selivanov, Victor L., On the Lattices of Effectively Open Sets, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 302-311
Kudinov, Oleg V. and Selivanov, Victor L. and Zhukov, Anton V., Undecidability in Weihrauch Degrees, in: Ferreira, Fernando and Löwe, Benedikt and Mayordomo, Elvira and Mendes Gomes, Luís (eds.), Programs, Proofs, Processes, vol. 6158 of Lecture Notes in Computer Science, Springer, Berlin, 2010, pages 256-265
Kumabe, Masahiro and Miyabe, Kenshi and Mizusawa, Yuki and Suzuki, Toshio, Solovay reducibility and continuity, Journal of Logic and Analysis12 (2020) Paper No. 2, 22
Kummer, Martin and Schäfer, Marcus, Computability of convex sets, in: Mayr, Ernst W. and Puech, Claude (eds.), STACS'95, vol. 900 of Lecture Notes in Computer Science, Springer, Berlin, 1995, pages 550-561
Kunkle, Daren, Computability on spaces of integrable functions, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 279-301
Kunkle, Daren, Type-2 computability on spaces of integrable functions, Mathematical Logic Quarterly50:4,5 (2004) 417-430
Kunkle, Daren and Schröder, Matthias, Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 111-123
Kushner, Boris Abramovich, Riemann integration in constructive analysis (Russian), Dokl. Akad. Nauk SSSR156 (1964) 255-257
Kushner, Boris Abramovich, Constructive theory of the Riemann integral (Russian), Dokl. Akad. Nauk SSSR165 (1965) 1238-1240
Kushner, Boris Abramovich, The existence of unbounded constructive analytic functions (Russian), Dokl. Akad. Nauk SSSR160 (1965) 29-31
Kushner, Boris Abramovich, On constructive antiderivatives (Russian), Mat. Zametki2 (1967) 157-166
Kushner, Boris Abramovich, A remark on the domains of definition of constructive analytic functions (Russian), Zap. Naučn. Sem. Leningrad. Otdel. Inst. Steklov.8 (1968) 103-106
Kushner, Boris Abramovich, Some mass problems connected with the integration of constructive functions (Russian), Trudy Mat. Inst. Steklov.113 (1970) 39-72
Kushner, Boris Abramovich, Computationally complex real numbers (Russian), Zeitschrift für Mathematische Logik und Grundlagen der Mathematik19 (1973) 447-452
Kushner, Boris Abramovich, Continuity theorems for some types of computable operators (Russian), Dokl. Akad. Nauk SSSR208 (1973) 1031-1034
Kushner, Boris Abramovich, Lectures on Constructive Mathematical Analysis (Russian), Izdat. Nauka, 1973
Kushner, Boris Abramovich, On a type of computable real function (Russian), Dokl. Akad. Nauk SSSR215 (1974) 259-262
Kushner, Boris Abramovich, A constructive version of König's theorem; functions that are computable in the sense of Markov, Grzegorczyk and Lacombe (Russian), in: Theory of algorithms and mathematical logic (dedicated to A.A. Markov on the occasion of his seventieth birthday), 1974, pages 87-111, 215
Kushner, Boris Abramovich, On Grzegorczyk's theorem on the computability of an isolated extremum (Russian), in: Markov, A.A. and Kušner, B.A. (eds.), Studies in the Theory of Algorithms and Mathematical Logic, 1976, pages 112-121, 158
Kushner, Boris Abramovich, The computation of isolated roots of constructive functions (Russian), Zeitschrift für Mathematische Logik und Grundlagen der Mathematik22 (1976) 311-332
Kushner, Boris Abramovich, Segmental coverings and uniform continuity of constructive functions (Russian), in: Markov, A.A. and Homič, V.I. (eds.), Studies in the Theory of Algorithms and Mathematical Logic, Nauka, 1979, pages 62-69, 133
Kushner, Boris Abramovich, Behavior of the general term of a Specker series (Russian), in: Gladkiĭ, M. (ed.), Mathematical Logic and Mathematical Linguistics, Kalinin. Gos. Univ., 1981, pages 112-116
Kushner, Boris Abramovich, On some topological properties of constructive plane curves (Russian), Dokl. Akad. Nauk SSSR260 (1981) 281-283
Kushner, Boris Abramovich, Some extensions of Markov's constructive continuum and their applications to the theory of constructive functions, in: Troelstra, A.S. and van Dalen, D. (eds.), The L.E.J. Brouwer Centenary Symposium (Noordwijkerhout, June 8-13,1981), vol. 110 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1982, pages 261-273
Kushner, Boris Abramovich, A class of Specker sequences (Russian), in: Gladliĭ, M. (ed.), Mathematical Logic, Mathematical Linguistics and Theory of Algorithms, Kalinin. Gos. Univ., 1983, pages 62-65
Kushner, Boris Abramovich, Lectures on Constructive Mathematical Analysis, vol. 60 of Translations of Mathematical Monographs, American Mathematical Society, Providence, 1984
Kushner, Boris Abramovich, Differentiability and uniform continuity of constructive functions (Russian), Doklady Akademii Nauk281 (1985) 1314-1316
Kushner, Boris Abramovich, The principle of bar-induction in Brouwer's theory of the continuum (Russian), in: Panov, M.I. (ed.), Patterns in the Development of Modern Mathematics, Methodological Aspects, Nauka, 1987, pages 230-250
Kushner, Boris Abramovich, Effective meaning of a theorem on uniform limit transition (Russian), in: Nagornyĭ, N.M. (ed.), Problems in Mathematical Logic and in the Theory of Algorithms, Akad. Nauk SSSR, Vyčisl. Centr., 1988, pages 3-10
Kushner, Boris Abramovich, Markov's constructive mathematical analysis: the expectations and the results, in: Petkov, P.P. (ed.), Mathematical Logic, Plenum, 1990, pages 53-58
Kushner, Boris Abramovich, Markov and Bishop: an essay in memory of A.A. Markov (1903-1979) and E. Bishop (1928-1983), in: Zdrovkovska, S. and Duren, P.L. (eds.), Golden Years of Moscow Mathematics, vol. 6 of Hist. Math., 1993, pages 179-197
Kushner, Boris Abramovich, The constructive mathematics of A.A. Markov: some reflections (Russian), Modern Logic3 (1993) 119-144
Kushner, Boris Abramovich, Kurt Gödel and the constructive mathematics of A.A. Markov, in: Hájek, P. (ed.), Gödel '96, vol. 6 of Lecture Notes in Logic, 1996, pages 50-63
Kushner, Boris Abramovich, Markov's constructive analysis; a participant's view, Theoretical Computer Science219 (1999) 267-285
Kushner, Boris Abramovich, The centenary of A.A. Markov, Jr.; His personality, his constructive mathematics, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 55-79
Kuyper, Rutger, Levels of uniformity, Notre Dame Journal of Formal Logic60:1 (2019) 119-138
Kuyper, Rutger and Terwijn, Sebastiaan A., Effective genericity and differentiability, Journal of Logic and Analysis6 (2014) Paper 4, 14
Kuznécov, A.V. and Trahténbrot, B.A., Investigation of partially recursive operators by means of the theory of Baire space (Russian), Dokl. Akad. Nauk SSSR105 (1955) 897-900
Kučera , A. and and Kushner, B., A type of recursive isomorphism of certain concepts of constructive analysis (Russian), Comment. Math. Univ. Carolinæ19 (1978) 97-105
Kučera, Antonín and Nies, André and Porter, Christopher P., Demuth's Path to Randomness, The Bulletin of Symbolic Logic21:3 (2015) 270-305
Labhalla, S. and Lombardi, H. and Moutai, E., Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact, Theoretical Computer Science250 (2001) 265-332
Labhalla, Salah, Complexité du calcul du développement d'un nombre réel en fractions continues, Theoretical Computer Science83 (1991) 219-235
Labhalla, Salah and Lombardi, Henri, Real numbers, continued fractions, and complexity classes, Annals of Pure and Applied Logic50 (1990) 1-28
Labhalla, Salah and Lombardi, Henri, Comparaison des complexités des nombres réels dans différentes représentations (à la Cauchy, à la Dedekind, par fractions continues), Comptes Rendus Académie des Sciences Paris310 (1990) 483-488
Labhalla, Salah and Lombardi, Henri, Comparaison des différentes représentations des nombres réels du point de vue des fonctionnelles récursives, Comptes Rendus Académie des Sciences Paris311 (1990) 229-234
Labhalla, Salah and Lombardi, Henri, Analyse de complexité pour un théorème de Hall sur les fractions continues, Mathematical Logic Quarterly42 (1996) 134-144
Labhalla, Salah-Eddine, Complexité du Calcul du Développement d'un Nombre Réel en Fractions Continués, PhD thesis, Université de Caen Normandie, 1986
Lachlan, A.H., Recursive real numbers, The Journal of Symbolic Logic28 (1963) 1-16
Lacombe, Daniel, Classes récursivement fermés et fonctions majorantes, Comptes Rendus Académie des Sciences Paris240 (1955) 716-718
Lacombe, Daniel, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, Comptes Rendus Académie des Sciences Paris240 (1955) 2478-2480
Lacombe, Daniel, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles II, Comptes Rendus Académie des Sciences Paris241 (1955) 13-14
Lacombe, Daniel, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles III, Comptes Rendus Académie des Sciences Paris241 (1955) 151-153
Lacombe, Daniel, Remarques sur les opérateurs récursifs et sur les fonctions récursives d'une variable réelle, Comptes Rendus Académie des Sciences Paris241 (1955) 1250-1252
Lacombe, Daniel, Les ensembles récursivement ouverts ou fermés, et leurs applications à l'Analyse récursive, Comptes Rendus Académie des Sciences Paris245 (1957) 1040-1043
Lacombe, Daniel, Quelques propriétés d'analyse récursive, Comptes Rendus Académie des Sciences Paris244 (1957) 838-840,996-997
Lacombe, Daniel, Les ensembles récursivement ouverts ou fermés, et leurs applications à l'Analyse récursive, Comptes Rendus Académie des Sciences Paris246 (1958) 28-31
Lacombe, Daniel, Sur les possibilites d'extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, in: Le raisonnement en mathematiques et en sciences, Editions du Centre National de la Recherche Scientifique, Paris, 1958, pages 67-75
Lacombe, Daniel, Quelques procédés de définition en topologie récursive, in: Heyting, A. (ed.), Constructivity in Mathematics, North-Holland, Amsterdam, 1959, pages 129-158
Lambov, Branimir, A two-layer approach to the computability and complexity of real functions, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 303-324
Lambov, Branimir, Rates of Convergence of Recursively Defined Sequences, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 125-133
Lambov, Branimir, RealLib: an efficient implementation of Exact Real Arithmetic, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 169-175
Lambov, Branimir, Topics in the Theory and Practice of Computable Analysis, PhD thesis, Department of Computer Science, University of Aarhus, Denmark, Aarhus, 2005
Langley, Simon and Richardson, Daniel, What can we do with a Solution?, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Lathrop, James I. and Lutz, Jack H. and Patterson, Brian, Multi-resolution cellular automata for real computation, in: Models of computation in context, vol. 6735 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2011, pages 181-190
Lawson, Jimmie D. and Lu, Bin, Riemann and Edalat integration on domains, Theoretical Computer Science305 (2003) 259-275
Le Roux, Stéphane and Ziegler, Martin, Singular Coverings and Non-Uniform Notions of Closed Set Computability, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 73-88
Le Roux, Stéphane and Pauly, Arno, Closed Choice for Finite and for Convex Sets, in: Bonizzoni, Paola and Brattka, Vasco and Löwe, Benedikt (eds.), The Nature of Computation. Logic, Algorithms, Applications, vol. 7921 of Lecture Notes in Computer Science, Springer, Berlin, 2013, pages 294-305
Le Roux, Stéphane and Pauly, Arno and Raskin, Jean-François, Minkowski Games, in: Vollmer, Heribert and Vallée, Brigitte (eds.), 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), vol. 66 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017, pages 50:1-50:13
Lehman, R.S., On primitive recursive real numbers, Fundamenta Mathematicae49 (1961) 105-118
Lester, David and Chambers, Scott and Lu, Heoi Lee, A constructive algorithm for finding the exact roots of polynomials with computable real coefficients, Theoretical Computer Science279 (2002) 51-64
Leuçtean, Laurenţiu, Proof Mining in R-trees and Hyperbolic Spaces, in: Mints, Grigori and de Queiroz, Ruy (eds.), Logic, Language, Information and Computation, vol. 165 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2006, pages 95-106
Leuçtean, Laurenţiu, A quadratic rate of asymptotic regularity for CAT(0)-spaces, J. Math. Anal. Appl.325 (2007) 386-399
Lewis, A.A., Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games, Math. Social Sciences24 (1992) 209-235
Lewis, Andrew and Nies, André and Sorbi, Andrea, The first order theories of the Medvedev and Muchnik lattices, in: Mathematical theory and computational practice, vol. 5635 of Lecture Notes in Comput. Sci., Springer, Berlin, 2009, pages 324-331
Lešnik, Davorin, Constructive Urysohn's Universal Metric Space, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 171-179
Lieutier, Andrè, Toward a data type for Solid Modeling based on Domain Theory, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 51-60
Lifschitz, Vladimir, Constructive assertions in an extension of classical mathematics, The Journal of Symbolic Logic47:2 (1982) 359-387
Lim, Donghyun and Ziegler, Martin, Quantitative Coding and Complexity Theory of Compact Metric Spaces, in: Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno (eds.), Beyond the Horizon of Computability, Springer International Publishing, Cham, 2020, pages 205-214
Lisovik, Leonid and Shkaravska, Olha, On Fractal Dimension of Sets Defined by Transducers, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 261-270
Loff, Bruno and Costa, José Félix and Mycka, Jerzy, Computability on reals, infinite limits and differential equations, Applied Mathematics and Computation191:2 (2007) 353-391
Logan M. Axon, Algorithmically random closed sets and probability, Ph.D. thesis, Department of Mathematics, University of Notre Dame, 2010
Longley, John and Normann, Dag, Higher-Order Computability, 1st ed., Springer, 2015
Lorenzen, Paul, Mass und Integral in der konstruktiven Analysis, Mathematische Zeitschrift54 (1951) 275-290
Lorenzen, Paul, Differential und Integral. Eine konstruktive Einführung in die klassische Analysis., Akademische Verlagsgesellschaft, Frankfurt, 1965
Lorenzen, Paul, Konstruktive Analysis und das geometrische Kontinuum, Dialectica32 (1978) 221-227
Lu, Dianchen and Wang, Qingyan, Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 219-236
Lu, Hong and Weihrauch, Klaus, Computable Riesz representation for the dual of C[0;1], in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 157-177
Lu, Hong and Weihrauch, Klaus, Computable Riesz Representation for Locally Compact Hausdorff Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 3-12
Lubarsky, Robert S., On the Cauchy completeness of the constructive Cauchy reals, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 225-254
Lubarsky, Robert S. and Diener, Hannes, Separating the Fan Theorem and its weakenings, in: Logical foundations of computer science, vol. 7734 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2013, pages 280-295
Lubarsky, Robert S. and Diener, Hannes, Principles weaker than BD-N, The Journal of Symbolic Logic78:3 (2013) 873-885
Luckhardt, Horst, A fundamental effect in computations on real numbers, Theoretical Computer Science5:3 (1977) 321-324
Lutz, Jack and Weihrauch, Klaus, Connectivity Properties of Dimension Level Sets, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 295-304
Lutz, Jack H., A divergence formula for randomness and dimension, in: Mathematical theory and computational practice, vol. 5635 of Lecture Notes in Comput. Sci., Springer, Berlin, 2009, pages 342-351
Lutz, Jack H. and Lutz, Neil, Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension, in: Vollmer, Heribert and Vallée, Brigitte (eds.), 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), vol. 66 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017, pages 53:1-53:13
Lutz, Jack H. and Mayordomo, Elvira, Dimensions of points in self-similar fractals, in: Computing and combinatorics, vol. 5092 of Lecture Notes in Comput. Sci., Springer, Berlin, 2008, pages 215-224
Lutz, Jack H. and Mayordomo, Elvira, Algorithmic Fractal Dimensions in Geometric Measure Theory, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 271-302
Lutz, Neil, Fractal intersections and products via algorithmic dimension, in: Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-François (eds.), 42nd International Symposium on Mathematical Foundations of Computer Science, vol. 83 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2017, page Art. No. 58, 12
Lutz, Neil and Stull, D. M., Bounding the dimension of points on a line, in: Gopal, T.V. and Jäger , Gerhard and Steila, Silvia (eds.), Theory and applications of models of computation, vol. 10185 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 425-439
Lutz, Neil and Stull, D. M., Bounding the dimension of points on a line, in: Gopal, T. V. and Jäger, Gerhard and Steila, Silvia (eds.), Theory and Applications of Models of Computation, vol. 10185 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 425-439
Lutz, Neil and Stull, D.M., Dimension Spectra of Lines, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 304-314
Lutz, Neil and Stull, Donald M., Projection theorems using effective dimension, in: Potapov, Igor and Spirakis, Paul and Worrell, James (eds.), 43rd International Symposium on Mathematical Foundations of Computer Science, vol. 117 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2018, page Art. No. 71, 15
Manin, Yuri I., A computability challenge: asymptotic bounds for error-correcting codes, in: Computation, physics and beyond, vol. 7160 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 174-182
Manin, Yuri I., Renormalization and computation I: motivation and background, in: OPERADS 2009, vol. 26 of Sémin. Congr., Soc. Math. France, Paris, 2013, pages 181-222
Manukjan, S. N., The interior points of non-degenerate constructive curves, Doklady Akademii Nauk SSSR196 (1971) 768-769
Manukjan, S. N., On interior points of nondegenerate constructive curves, Soviet Mathematics. Doklady12 (1971) 246-248
Manukjan, S. N., Constructive everywhere dense simple arcs, Izvestija Akademii Nauk Armjanskoĭ SSR. Serija Matematika8:4 (1973) 291-305, 346
Manukjan, S. N., The stability of constructive simple arcs with respect to algorithmic transformations, Doklady Akademii Nauk SSSR220 (1975) 1267-1270
Manukjan, S. N., Some properties of partitionings of the plane by nondegenerate constructive curves, Trudy Vyčisl. Centra Akad. Nauk Armjan. SSR i Erevan. Gos. Univ. Mat. Voprosy Kibernet. i Vyčisl. Tehn.8 (1975) 67-95
Manukjan, S. N., The stability of constructive simple arcs with respect to algorithmic transformations, Soviet Mathematics. Doklady16 (1975) 238-242
Manukjan, S. N., Some properties of partitioning of the plane by non-degenerate constructive curves, Tr. Vychisl. Tsentra Akad. Nauk Arm. SSR Erevan. Gos. Univ.8 (1975) 67-95
Manukjan, S. N., Some topological peculiarities of constructive simple arcs, in: Markov, A.A. and Kushner, B. A. (eds.), Studies in the theory of algorithms and mathematical logic, Vol. 2 (Russian), Vyčisl. Centr Akad. Nauk SSSR, Moscow, 1976, pages 122-129, 158
Manukjan, S.N. and Zaslavskiĭ, Igor D., Partitionings of the plane by constructive curves (Russian), Trudy Vyčisl. Centr. Akad. Nauk Armjan. SSR i Erevan. Gos. Univ.5 (1968) 26-138
Manukyan, S. N., On a property of the notion of interior and exterior point with respect to constructive closed curve, Izvestiya Akademii Nauk Armyanskoi SSR. Matematika12 (1977) 303-309
Manukyan, S. N., Algorithms transforming constructive curves into points, Matematicheskie Voprosy Kibernetiki i Vychislitel´ noĭ Tekhniki. Trudy Vychislitel´ nogo Tsentra Akademii Nauk Armyanskoĭ SSR i Erevanskogo Gosudarstvennogo Universiteta :10 (1982) 55-71
Manukyan, S. N., The Dirichlet problem in constructive analysis, Akademiya Nauk Armyanskoĭ SSR. Doklady79:2 (1984) 58-62
Manukyan, S. N., On uniqueness properties of constructive analytic functions, Soviet Journal of Contemporary Mathematical Analysis. Armenian Academy of Sciences21:2 (1986) 95-103
Manukyan, S. N., Uniqueness properties for constructive analytic functions, Izvestiya Akademii Nauk Armyanskoĭ SSR. Seriya Matematika21:2 (1986) 198-206, 208
Marcial-Romero, J. Raymundo and Moshier, M. Andrew, Sequential Real Number Computation and Recursive Relations, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 171-189
Margenstern, Maurice, On a variant of constructivisation of the theory of almost periodic functions, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik24:6 (1978) 495-507
Martin, Keye, Complexity and Verification of a Renee Equation, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 271-286
Martin-Löf, Per, Notes on constructive mathematics, Almqvist and Wiksell, Stockholm, 1970
Matijasevič, Yu.V. and Mints, G.E. and Orevkov, V.P. and Slisenko, A.O., Nikolaĭ Aleksandrovich Shanin (on his seventieth birthday), (Russian), Uspekhi Mat. Nauk45 (1990) 205-206
Mayordomo Cámara, Elvira, Effective Hausdorff dimension, in: Classical and new paradigms of computation and their complexity hierarchies, vol. 23 of Trends Log. Stud. Log. Libr., Kluwer Acad. Publ., Dordrecht, 2004, pages 171-186
McKubre-Jordens, Maarten and Wilson, Phillip L., Infinity in Computable Probability, Journal of Applied Logics - IfCoLog Journal of Logics and their Applications6:7 (2019) 1253-1261
McNicholl, Timothy H., Computability and the implicit function theorem, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 3-15
McNicholl, Timothy H., Uniformly computable aspects of inner functions, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 27-36
McNicholl, Timothy H., A Note on the Computable Categoricity of ℓ^p Spaces, in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 268-275
Merkle, Wolfgang and Titov, Ivan, Speedable Left-c.e. Numbers, in: Henning Fernau (ed.), Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings, vol. 12159 of Lecture Notes in Computer Science, Springer, 2020, pages 303-313
Metakides, George and Nerode, Anil, The introduction of non-recursive methods into mathematics, in: Troelstra, A.S. and van Dalen, D. (eds.), The L.E.J. Brouwer Centenary Symposium, vol. 110 of Studies in Logic and the foundations of mathematics, North-Holland, Amsterdam, 1982, pages 319-335
Metakides, George and Nerode, Anil and Shore, Richard A., Recursive limits on the Hahn-Banach theorem, in: Rosenblatt, Murray (ed.), Errett Bishop: Reflections on Him and His Research, vol. 39 of Contemporary Mathematics, American Mathematical Society, Providence, 1985, pages 85-91
Meyssonnier, Charles and Boldi, Paolo and Vigna, Sebastiano, δ-Approximable Functions, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 187-199
Mielke, Jöran, Refined Bounds on Kolmogorov Complexity for ω-Languages, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 181-189
Miller, Joseph S., Effectiveness for Embedded Spheres and Balls, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Miller, Joseph S., Degrees of unsolvability of continuous functions, The Journal of Symbolic Logic69:2 (2004) 555-584
Miller, Joseph S., On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 644-659
Miller, Joseph S. and Rute, Jason, Energy randomness, Israel Journal of Mathematics227:1 (2018) 1-26
Miller, Joseph Stephen, Pi-0-1 Classes in Computable Analysis and Topology, PhD thesis, Cornell University, Ithaca, USA, 2002
Miyabe, Kenshi, Uniform Relativization, in: Manea, Florin and Martin, Barnaby and Paulusma, Daniël and Primiero, Giuseppe (eds.), Computing with Foresight and Industry, vol. 11558 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 50-61
Miyabe, Kenshi, Muchnik degrees and Medvedev degrees of randomness notions, in: Proceedings of the 14th and 15th Asian Logic Conferences, World Sci. Publ., Hackensack, NJ, 2019, pages 108-128
Miyamoto, Shoki and Yoshikawa, Atsushi, Computable sequences in the Sobolev spaces, Proc. Japan Acad. Ser. A80:3 (2004) 15-17
Monin, Benoit, Higher randomness, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 232-300
Moore, Cristopher, Recursion theory on the reals and continuous-time computation, Theoretical Computer Science162:1 (1996) 23-44
Mori, Takakazu, Computabilities of Fine-Continuous Functions, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 200-221
Mori, Takakazu, On the computability of Walsh functions, Theoretical Computer Science284:2 (2002) 419-436
Mori, Takakazu and Tsujii, Yoshiki and Yasugi, Mariko, Computability Structures on Metric Spaces, in: Bridges, Douglas S. and Calude, Cristian S. and Gibbons, Jeremy and Reeves, Steve and Witten, Ian H. (eds.), Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pages 351-362
Mori, Takakazu and Tsujii, Yoshiki and Yasugi, Mariko, Fine computable functions and effective Fine convergence, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 177-197
Mori, Takakazu and Tsujii, Yoshiki and Yasugi, Mariko, Fine convergence of functions and its effectivization, in: Automata, formal languages and algebraic systems, World Sci. Publ., Hackensack, NJ, 2010, pages 139-162
Mori, Takakazu and Yasugi, Mariko and Tsujii, Yoshiki, Integral of Two-dimensional Fine-computable Functions, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 141-152
Mori, Takakazu and Yasugi, Mariko and Tsujii, Yoshiki, Integral of Fine Computable functions and Walsh Fourier series, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 279-293
Morozov, Andrei and Korovina, Margarita, Remarks on Σ-definability without the equality test over the reals, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 315-322
Morozov, Andrey S., Computable Model Theory over the Reals, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 354-365
Moschovakis, J.R., A classical view of the intuitionistic continuum, Annals of Pure and Applied Logic81 (1996) 9-24
Moser, Philippe, On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 13-18
Mostowski, Andrzej, A lemma concerning recursive functions and its applications, Bull. Acad. Polon. Sci. Cl. III1 (1953) 277-280
Mostowski, Andrzej, The present state of investigations on the foundations of mathematics, vol. 9 of Rozprawy Matematyczne, Polska Akademia Nauk, Warsaw, 1955
Mostowski, Andrzej, On computable sequences, Fundamenta Mathematicae44 (1957) 37-51
Mostowski, Andrzej, On various degrees of constructivism, in: Heyting, A. (ed.), Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pages 178-194
Mulupuru, Bharat C. and Kreinovich, Vladik and Osegueda, Roberto, Interval Approach to Phase Measurements Can Lead to Arbitrarily Complex Sets - A Theorem and Ways Around It, Numerical Algorithms37 (2004) 285-299
Mycka, Jerzy, Two hierarchies of R-recursive functions, Annales UMCS Informatica Lublin-Polonia AI1 (2003) 49-59
Mycka, Jerzy, Real recursive functions and Baire classes, Fundamenta Informaticae65:3 (2005) 263-278
Mycka, Jerzy and Costa, José Félix, Real recursive functions and their hierarchy, Journal of Complexity20:6 (2004) 835-857
Mycka, Jerzy and Costa, José Félix, The computational power of continuous dynamic systems, in: Maurice Margenstern (ed.), Machines, Computations, Universality, vol. 3354 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 163-174
Mycka, Jerzy and Costa, José Félix, The P≠NP conjecture in the context of real and complex analysis, Journal of Complexity22:2 (2006) 287-303
Myhill, J. and Shepherdson, J., Effective operations on partial recursive functions, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik1 (1955) 310-317
Myhill, John, Criteria of constructibility for real numbers, The Journal of Symbolic Logic18:1 (1953) 7-10
Myhill, John, A recursive function defined on a compact interval and having a continuous derivative that is not recursive, Michigan Math. J.18 (1971) 97-98
Myhill, John, What is a real number?, The American Mathematical Monthly79 (1972) 748-754
Mylatz, Uwe, Vergleich unstetiger Funktionen: "Principle of Omniscience" und Vollständigkeit in der C-Hierarchie, Ph.D. thesis, Faculty for Mathematics and Computer Science, University Hagen, Hagen, Germany, 2006
Myrvold, Wayne C., Computability in Quantum Mechanics, in: DePauli-Schimanovich, Werner and Köhler, Eckehart and Stadler, Friedrich (eds.), The foundational debate, vol. 3 of Vienna Circle Institute Yearbook, Kluwer, Dordrecht, 1995, pages 33-46
Myrvold, Wayne C., The decision problem for entanglement, in: Cohen, Robert S. and Horne, Michael and Stachel, John (eds.), Potentiality, Entanglement and Passion-at-a-Distance, vol. 194 of Boston Studies in the Philosophy of Science, Kluwer, Dordrecht, 1997, pages 177-190
Müller, Norbert Th. and Zhao, Xishun, Jordan Areas and Grids, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 191-206
Müller, Norbert Th., Subpolynomial complexity classes of real functions and real numbers, in: Kott, Laurent (ed.), Proceedings of the 13th International Colloquium on Automata, Languages, and Programming, vol. 226 of Lecture Notes in Computer Science, Springer, Berlin, 1986, pages 284-293
Müller, Norbert Th., Uniform Computational Complexity of Taylor series, in: Ottmann, Thomas (ed.), Proceedings of the 14th International Colloquium on Automata, Languages, and Programming, vol. 267 of Lecture Notes in Computer Science, Springer, Berlin, 1987, pages 435-444
Müller, Norbert Th., Untersuchungen zur Komplexität reeller Funktionen, PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1988
Müller, Norbert Th., Polynomial Time Computation of Taylor series, in: Proceedings of the 22th JAIIO - Panel'93, Part 2, 1993, pages 259-281
Müller, Norbert Th., Constructive aspects of analytic functions, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 105-114
Müller, Norbert Th., Towards a real Real RAM: a prototype using C++, in: Ko, Ker-I and Müller, Norbert and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Universität Trier, 1996, pages 59-66
Müller, Norbert Th., Implementing limits in an interactive RealRAM, in: Chesneaux, J.-M. and Jézéquel, F. and Lamotte, J.-L. and Vignes, J. (eds.), Third Real Numbers and Computers Conference, Université Pierre et Marie Curie, Paris, 1998, pages 59-66
Müller, Norbert Th., Computability on random variables, Theoretical Computer Science219:1-2 (1999) 287-299
Müller, Norbert Th., The iRRAM: Exact Arithmetic in C++, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 222-252
Müller, Norbert Th., Real Numbers and BDDs, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Müller, Norbert Th. and Moiske, B., Solving Initial Value Problems in Polynomial Time, in: Proceedings of the 22th JAIIO - Panel'93, Part 2, 1993, pages 283-293
Ménissier-Morain, Valérie, Arbitrary precision real arithmetic: design and algorithms, The Journal of Logic and Algebraic Programming64 (2005) 13-39
Nakamura, Masahiro, Ergodic theorems for algorithmically random sequences, in: Dinneen, Michael J. and Speidel, Ulrich and Taylor, Desmond P. (eds.), Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity ITW 2005, 2005, pages 147-150
Nakata, Masahiro and Hayashi, Susumu, A limiting first order realizability interpretation, Sci. Math. Jpn.55:3 (2002) 567-580
Nandakumar, Satyadev, Characterization of Constructive Dimension, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 323-337
Nandakumar, Satyadev and Vishnoi, Prateek, Randomness and Effective Dimension of Continued Fractions, in: Esparza, Javier and Král', Daniel (eds.), 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), vol. 170 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pages 73:1-73:13
Nedialkov, Nedialko S. and Kreinovich, Vladik and Starks, Scott A., Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?, Numerical Algorithms37 (2004) 325-336
Nemoto, Takako, Weak weak König's lemma in constructive reverse mathematics, in: Proceedings of the 10th Asian Logic Conference (ALC 10), 2008, page 263–270
Nerode, Anil, General topology and partial recursive functionals, in: Summaries of Talks at the AMS Summer Institute in Symbolic Logic, Cornell University Mathematics Department, 1957
Nerode, Anil and Huang, Wen-Qi, Application of pure recursion theory in recursive analysis, Acta Mathematica Sinica28 (1985) 625-636
Nerode, Anil and Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Special issue of Theoretical Computer Science, Elsevier, Amsterdam, 1999
Neumann, Eike, On envelopes and backward approximations, in: Revolutions and revelations in computability, vol. 13359 of Lecture Notes in Computer Science, Springer, Cham, 2022, pages 220-233
Ng, Keng Meng and Stephan, Frank and Wu, Guohua, Degrees of Weakly Computable Reals, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 413-422
Nies, André, Differentiability of polynomial time computable functions, in: Ernst W. Mayr and Natacha Portier (eds.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), vol. 25 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2014, pages 602-613
Nies, André, Lowness, Randomness, and Computable Analysis, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 738-754
Nies, André and Solecki, Slawomir, Local Compactness for Computable Polish Metric Spaces is Π_1^1-complete, in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 286-290
Nies, André and Stephan, Frank, Randomness and Initial Segment Complexity for Probability Measures, in: Paul, Christophe and Bläser, Markus (eds.), 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), vol. 154 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pages 55:1-55:14
Niqui, Milad, Formalizing Exact Arithmetic - Representations, Algorithms and Proofs, PhD thesis, Institute for Programming Research and Algorithmics, University of Nijmegen, Nijmegen, 2004
Niqui, Milad, Formalising Exact Arithmetic in Type Theory, in: Cooper, Barry S. and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 368-377
Niqui, Milad, Coinductive field of exact real numbers and general corecursion, in: Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science (CMCS 2006), vol. 164 of Electron. Notes Theor. Comput. Sci., Elsevier, Amsterdam, 2006, pages 121-139 (electronic)
Nobrega, Hugo, Games for functions - Baire classes, Weihrauch degrees, Transfinite Computations, and Ranks, PhD thesis, Institute for Logic, Language and Computation, Universiteit van Amsterdam, 2018
Nobrega, Hugo and Pauly, Arno, Game Characterizations and Lower Cones in the Weihrauch Degrees, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 327-337
Nogina, Elena Ju., Effectively topological spaces, Dokl. Akad. Nauk SSSR169 (1966) 28-31
Nogina, Elena Ju., Correlations between certain classes of effectively topological spaces, Mat. Zametki5 (1969) 483-495
Nogina, Elena Ju., Enumerable topological spaces (Russian), Zeitschrift für Mathematische Logik und Grundlagen der Mathematik24:2 (1978) 141-176
Nogina, Elena Ju., The relation between separability and traceability of sets (Russian), in: Mathematical logic and mathematical linguistics, Kalinin. Gos. Univ., Klinin, 1981, pages 135-144
Normann, Dag, Exact real number computations relative to hereditarily total functionals, Theoretical Computer Science284:2 (2002) 437-453
Normann, Dag, Hierarchies of total functionals over the reals, Theoretical Computer Science316 (2004) 137-151
Ord, Toby and Kieu, Tien D., On the existence of a new family of Diophantine equations for Ω, Fundamenta Informaticae56:3 (2003) 273-284
Ord, Toby and Kieu, Tien D., Ω in number theory, in: Calude, Cristian S. (ed.), Randomness and Complexity, World Scientific, Hackensack, NJ, 2007, pages 161-173
Orevkov, Vladimir P., A constructive mapping of the square onto itself displacing every constructive point (Russian), Doklady Akademii Nauk152 (1963) 55-58
Orevkov, Vladimir P., Constructive mappings of polyhedra (Russian), Doklady Akademii Nauk152 (1963) 278-281
Orevkov, Vladimir P., Certain questions of the theory of polynomials with constructive real coefficients (Russian), Trudy Mat. Inst. Steklov.72 (1964) 462-487
Orevkov, Vladimir P., On constructive mappings of a circle into itself (Russian), Trudy Mat. Inst. Steklov.72 (1964) 437-461
Orevkov, Vladimir P., Certain types of continuity of constructive operators (Russian), Trudy Mat. Inst. Steklov.93 (1967) 164-186
Orevkov, Vladimir P., Constructive mappings of finite polyhedra (Russian), Trudy Mat. Inst. Steklov.93 (1967) 142-163
Orevkov, Vladimir P., Certain properties of homeomorphisms of constructive metric spaces (Russian), Zap. Naučn. Sem. Leningrad. Otdel. Inst. Steklov.16 (1969) 157-164
Orevkov, Vladimir P., The continuity of constructive functionals (Russian), Zap. Naučn. Sem. Leningrad. Otdel. Inst. Steklov.20 (1971) 160-169,287
Orevkov, Vladimir P., The complexity of the expansion of algebraic irrationalities in continued fractions (Russian), Trudy Mat. Inst. Steklov.129 (1973) 24-29,267
Orevkov, Vladimir P., A new proof of the uniqueness theorem for constructive differentiable functions of a complex variable (Russian), Zap. Naučn. Sem. Leningrad. Otdel. Inst. Steklov.40 (1974) 119-126,159
Ouspensky, V.A., Leçons sur les fonctions calculables, Mathematical Logic and the Foundations of Mathematics, Hermann, Paris, 1966
Pattinson, Dirk, Domain-Theoretic Formulation of Linear Boundary Value Problems, in: Cooper, Barry S. and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 385-395
Pauly, Arno, How Discontinuous is Computing Nash Equilibria? (Extended Abstract), in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), 6th International Conference on Computability and Complexity in Analysis (CCA'09), vol. 11 of OpenAccess Series in Informatics (OASIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2009
Pauly, Arno, Computable Metamathematics and its Application to Game Theory, Ph.D. thesis, University of Cambridge, Computer Laboratory, Clare College, Cambridge, 2011
Pauly, Arno, Multi-valued functions in computability theory, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 571-580
Pauly, Arno, Enumeration Degrees and Topology, in: Manea, Florin and Miller, Russell G. and Nowotka, Dirk (eds.), Sailing Routes in the World of Computation, Springer, Cham, 2018, pages 328-337
Pauly, Arno and de Brecht, Matthew, Non-deterministic computation and the Jayne-Rogers Theorem, in: Löwe, Benedikt and Winskel, Glynn (eds.), Proceedings 8th International Workshop on Developments in Computational Models, DCM 2012, Cambridge, United Kingdom, 17 June 2012., vol. 143 of Electronic Proceedings in Theoretical Computer Science, 2014, pages 87-96
Pauly, Arno and Seon, Dongseong and Ziegler, Martin, Computing Haar measures, in: Fernández, Maribel and Muscholl, Anca (eds.), 28th EACSL Annual Conference on Computer Science Logic, vol. 152 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, 2020, pages 34:1-34:17
Peng, NingNing and Higuchi, Kojiro and Yamazaki, Takeshi and Tanaka, Kazuyuki, Relative randomness for Martin-Löf random sets, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 581-588
Peshev, Peter and Skordev, Dimiter, A Subrecursive Refinement of the Fundamental Theorem of Algebra, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 435-444
Petrakis, Iosif, Completely Regular Bishop Spaces, in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 302-312
Petrakis, Iosif, A constructive function-theoretic approach to topological compactness, in: Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016), ACM, New York, 2016, page 10
Petrakis, Iosif, The Urysohn extension theorem for Bishop spaces, in: Logical foundations of computer science, vol. 9537 of Lecture Notes in Comput. Sci., Springer, Cham, 2016, pages 299-316
Petrakis, Iosif, McShane-Whitney Pairs, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 351-363
Petrakis, Iosif, A density theorem for hierarchies of limit spaces over separable metric spaces, in: Theory and applications of models of computation, vol. 10185 of Lecture Notes in Comput. Sci., Springer, Cham, 2017, pages 484-498
Petrakis, Iosif, Borel and Baire Sets in Bishop Spaces, in: Manea, Florin and Martin, Barnaby and Paulusma, Daniël and Primiero, Giuseppe (eds.), Computing with Foresight and Industry, vol. 11558 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 240-252
Petrakis, Iosif, Constructive uniformities of pseudometrics and Bishop topologies, Journal of Logic and Analysis11 (2019) Paper No. FT2, 44
Petrakis, Iosif, Functions of Baire Class One over a Bishop Topology, in: Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno (eds.), Beyond the Horizon of Computability, Springer International Publishing, Cham, 2020, pages 215-227
Phan Dình-Diêu, Constructive locally convex linear topological spaces (Russian), Doklady Akademii Nauk162 (1965) 766-769
Phan Dình-Diêu, The metrizability, normability and multinormability of constructive locally convex spaces (Russian), Doklady Akademii Nauk162 (1965) 1011-1014
Phan Dình-Diêu, On conjugates to constructive, locally convex spaces (Russian), Doklady Akademii Nauk166 (1966) 45-48
Phan Dình-Diêu, Certain properties of constructive generalized functions (Russian), Doklady Akademii Nauk174 (1967) 298-301
Phan Dình-Diêu, A language for constructive mathematics, connected with systems of sets (Russian), Trudy Mat. Inst. Steklova93 (1967) 123-141
Phan Dình-Diêu, Closed and open sets in constructive topological spaces (Russian), Trudy Mat. Inst. Steklova93 (1967) 250-256
Phan Dình-Diêu, Spaces of constructive infinitely differentiable functions, and functionals therein (Russian), Doklady Akademii Nauk180 (1968) 799-802
Phan Dình-Diêu, Some questions in constructive functional analysis, vol. 114 of Proceedings of the Steklov Institute of Mathematics, American Mathematical Society, Providence, 1974
Plato, Jan von, Order in open intervals of computable reals, Mathematical Structures in Computer Science9 (1999) 103-108
Popa, Gabriela, A theoretical constructivisation of mathematical economics, PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2003
Porter, Christopher P., Biased algorithmic randomness, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 206-231
Porter, Michelle and Day, Adam and Downey, Rodney, Notes on computable analysis, Theory of Computing Systems60:1 (2017) 53-111
Pour-El, Marian B., Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers), Trans. Amer. Math. Soc.199 (1974) 1-28
Pour-El, Marian B., Church's thesis and recursive analysis, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 115-118
Pour-El, Marian B., Some Open Problems in Computable Analysis, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, page 61
Pour-El, Marian B., The structure of computability in analysis and physical theory: An extension of Church's thesis, in: Griffor, Edward R. (ed.), Handbook of Computability Theory, vol. 140 of Studies in Logic and the Foundations of Mathematics, Elsevier, Amsterdam, 1999, pages 449-471
Pour-El, Marian B., From axiomatics to intrinsic characterization: some open problems in computable analysis, Theoretical Computer Science219 (1999) 319-329
Pour-El, Marian B. and Caldwell, J., On a simple definition of computable functions of a real variable - with applications to functions of a complex variable, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik21 (1975) 1-19
Pour-El, Marian B. and Richards, J. Ian, Differentiability properties of computable functions - a summary, Acta Cybernetica4 (1978) 123-125
Pour-El, Marian B. and Richards, J. Ian, A computable ordinary differential equation which possesses no computable solution, Annals Math. Logic17 (1979) 61-90
Pour-El, Marian B. and Richards, J. Ian, The wave equation with computable initial data such that its unique solution is not computable, Advances in Math.39 (1981) 215-239
Pour-El, Marian B. and Richards, J. Ian, Computability and noncomputability in classical analysis, Trans. Amer. Math. Soc.275 (1983) 539-560
Pour-El, Marian B. and Richards, J. Ian, Noncomputability in analysis and physics: a complete determination of the class of noncomputable linear operators, Advances in Math.48 (1983) 44-74
Pour-El, Marian B. and Richards, J. Ian, L^p-computability in recursive analysis, Proceedings of the American Mathematical Society92 (1984) 93-97
Pour-El, Marian B. and Richards, J. Ian, Three theorems on the computability of linear operators, their eigenvalues and eigenvectors, Sūrikaisekikenkyūsho Kōkyūroku588 (1986) 149-161
Pour-El, Marian B. and Richards, J. Ian, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, Advances in Math.63 (1987) 1-41
Pour-El, Marian B. and Richards, J. Ian, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer, Berlin, 1989
Pour-El, Marian B. and Zhong, Ning, The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable, Mathematical Logic Quarterly43:4 (1997) 499-509
Pour-El, Marian B. and Zhong, Ning, Boundary regularity and computability, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 325-343
Pourmahdian, Masoud and Tavana, Nazanin R. and Didehvar, Farzad, Effective metric model theory, Mathematical Structures in Computer Science25 (2015) 1779-1798
Poças, Diogo and Zucker, Jeffery, Fixed point techniques in analog systems, in: Bélair, Jacques and Frigaard, Ian A. and Kunze, Herb and Makarov, Roman and Melnik, Roderick and Spiteri, Raymond J. (eds.), Mathematical and Computational Approaches in Advancing Modern Science and Engineering, Springer, Cham, 2016, pages 701-711
Putnam, Hilary, Trial and error predicates and the solution to a problem of Mostowski, The Journal of Symbolic Logic30 (1965) 49-57
Pégny, Maël, Sur les limites empiriques du calcul - Calculabilité, complexité et physique, PhD thesis, Université Paris 1 Panthéon-Sorbonne, Paris, France, 2013
Péter, Rózsa, Recursive Functions, 3rd ed., Academic Press, New York, 1967
Raichev, Alexander, Relative Randomness and Real Closed Fields, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 135-143
Rakotoniaina, Tahina, On the Computational Strength of Ramsey's Theorem, Ph.D. thesis, Department of Mathematics and Applied Mathematics, University of Cape Town, Rondebosch, South Africa, 2015
Rauzy, Emmanuel, Perspectives on an effective theory of groups, PhD thesis, Université de Paris, 2022
Reimann, Jan and Slaman, Theodore A., Measures and their random reals, Transactions American Mathematical Society367:7 (2015) 5081-5097
Rettinger, Robert, A fast algorithm for Julia sets of hyperbolic rational functions, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 145-157
Rettinger, Robert, Computable Riemann Surfaces, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 638-647
Rettinger, Robert, Lower Bounds on the Continuation of Holomorphic Functions, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 207-217
Rettinger, Robert, On the Computability of Blochs Constant, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 315-322
Rettinger, Robert, Compactness and the effectivity of uniformization, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012, pages 626-625
Rettinger, Robert, On computable approximations of Landau's constant, Log. Methods Comput. Sci.8:4 (2012) 4:15, 11
Rettinger, Robert and Weihrauch, Klaus, The Computational Complexity of Some Julia Sets, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Rettinger, Robert and Weihrauch, Klaus, The computational complexity of some Julia sets, in: Goemans, Michel X. (ed.), Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2003, pages 177-185
Rettinger, Robert and Weihrauch, Klaus and Zhong, Ning, Complexity of Blowup Problems (Extended Abstract), in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 219-230
Rettinger, Robert and Zheng, Xizhong, Hierarchy of Monotonically Computable Real Numbers, in: Sgall, Jiří and Pultr, Aleš and Kolman, Petr (eds.), Mathematical Foundations of Computer Science 2001, vol. 2136 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 633-644
Rettinger, Robert and Zheng, Xizhong, On the hierarchy and extension of monotonically computable real numbers, Journal of Complexity19 (2003) 672-691
Rettinger, Robert and Zheng, Xizhong, On the Turing Degrees of Divergence Bounded Computable Reals, in: Cooper, S. Barry and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 418-428
Rettinger, Robert and Zheng, Xizhong, Solovay reducibility on d-c.e. real numbers, in: Wang, Lusheng (ed.), Computing and Combinatorics, vol. 3595 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 359-368
Rettinger, Robert and Zheng, Xizhong, Points on computable curves of computable lengths, in: Mathematical Foundations of Computer Science 2009, vol. 5734 of Lecture Notes in Computer Science, Springer, Berlin, 2009, pages 736-743
Rettinger, Robert and Zheng, Xizhong, Computability of Real Numbers, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 3-28
Rettinger, Robert and Zheng, Xizhong and Gengler, Romain and von Braunmühl, Burchard, Monotonically Computable Real Numbers, in: Calude, C.S. and Dinneen, M.J. and Sburlan, S. (eds.), Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, London, 2001, pages 187-201
Rettinger, Robert and Zheng, Xizhong and Gengler, Romain and von Braunmühl, Burchard, Weakly Computable Real Numbers and Total Computable Real Functions, in: Wang, Jie (ed.), Computing and Combinatorics, vol. 2108 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 586-595
Rettinger, Robert and Zheng, Xizhong and Gengler, Romain and von Braunmühl, Burchard, Monotonically Computable Real Numbers, Mathematical Logic Quarterly48:3 (2002) 459-479
Rettinger, Robert and Zheng, Xizhong and von Braunmühl, Burchard, Computable Real Functions of Bounded Variation and semi-Computable Real Numbers, in: Ibarra, Oscar H. and Zhang, Louxin (eds.), Computing and Combinatorics, vol. 2387 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 47-56
Rice, H. Gordon, Recursive real numbers, Proc. Amer. Math. Soc.5 (1954) 784-791
Richardson, D.B., Some undecidable problems involving elementary functions of a real variable, The Journal of Symbolic Logic33 (1968) 514-520
Richardson, Daniel, The Uniformity Conjecture, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 253-272
Richman, Fred, Constructive Mathematics without Choice, in: Peter Schuster and Ulrich Berger and Horst Osswald (eds.), Reuniting the Antipodes: Constructive and Nonstandard Views of the Continuum, vol. 306 of Synthese Library, Kluwer A. P., 2001
Richman, Fred, Omniscience Principles and Functions of Bounded Variation, Mathematical Logic Quarterly48:1 (2002) 111-116
Richman, Fred, Intuitionistic notions of boundedness in \mathbbN, Mathematical Logic Quarterly55:1 (2009) 31-36
Richman, Fred and Bridges, Douglas S., A constructive proof of Gleason's theorem, Journal of Functional Analysis162:2 (1999) 287-312
Richman, Fred and Bridges, Douglas S. and Calder, Allan and Julian, William and Mines, Ray, Compactly generated Banach spaces, Archiv der Mathematik. Archives of Mathematics. Archives Mathématiques36:3 (1981) 239-243
Richman, Fred and Bridges, Douglas S. and Schuster, Peter, Trace-class operators, Houston Journal of Mathematics28:3 (2002) 565-583
Richter, Marcel K. and Wong, Kam-Chau, Computable Economic Analysis, in: Ko, Ker-I and Müller, Norbert and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Universität Trier, 1996, pages 81-90
Richter, Marcel K. and Wong, Kam-Chau, Computable preference and utility, Journal of Mathematical Economics32:3 (1999) 339-354
Richter, Marcel K. and Wong, Kam-Chau, Non-computability of competitive equilibrium, Economic Theory14:1 (1999) 1-27
Robinson, R.M., Review of "Peter, R., Rekursive Funktionen", The Journal of Symbolic Logic16 (1951) 280-282
Rojas, Cristóbal and Yampolsky, Michael, Computable Geometric Complex Analysis and Complex Dynamics, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 143-172
Roy, Daniel, Computability, inference and modeling in probabilistic programming, PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Boston, USA, 2011
Ruohonen, Keijo, Event detection for ODEs and nonrecursive hierarchies, in: Karhumäki, J. and Maurer, H. and Rozenberg, G. (eds.), Results and trends in theoretical computer science (Graz, 1994), vol. 812 of Lecture Notes in Computer Science, Springer, Berlin, 1994, pages 358-371
Rute, Jason, Algorithmic randomness and constructive/computable measure theory, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 58-114
Sambin, Giovanni, Some points in formal topology, Theoretical Computer Science305 (2003) 347-408
Sambin, Giovanni, Doing Without Turing Machines: Constructivism and Formal Topology, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 674-675
Sanders, Sam, On the connection between nonstandard analysis and constructive analysis, Logique et Analyse56:222 (2013) 183-210
Sanders, Sam, On algorithm and robustness in a non-standard sense, in: New challenges to philosophy of science, vol. 4 of Philos. Sci. Eur. Perspect., Springer, Dordrecht, 2013, pages 99-112
Sanders, Sam, The computational content of nonstandard analysis, in: Proceedings Sixth International Workshop on Classical Logic and Computation, vol. 213 of Electron. Proc. Theor. Comput. Sci. (EPTCS), EPTCS, 2016, pages 24-40
Sanders, Sam, From nonstandard analysis to various flavours of computability theory, in: Theory and applications of models of computation, vol. 10185 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 556-570
Sanders, Sam, Nets and Reverse Mathematics, in: Manea, Florin and Martin, Barnaby and Paulusma, Daniël and Primiero, Giuseppe (eds.), Computing with Foresight and Industry, vol. 11558 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 253-264
Sanders, Sam, Splittings and Robustness for the Heine-Borel Theorem, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 395-406
Sanders, Sam, The Non-normal Abyss in Kleene's Computability Theory, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 37-49
Schnorr, Claus Peter, Zufälligkeit und Wahrscheinlichkeit, vol. 218 of Lecture Notes in Mathematics, Springer, Berlin, 1971
Schnorr, Claus Peter, Komplexität von Algorithmen mit Anwendung auf die Analysis, Archiv für Mathematische Logik und Grundlagenforschung14 (1971) 54-68
Schröder, Matthias, Topological spaces allowing type 2 complexity theory, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 41-53
Schröder, Matthias, Fast Online Multiplication of Real Numbers, in: Reischuk, Rüdiger and Morvan, Michel (eds.), STACS 97, vol. 1200 of Lecture Notes in Computer Science, Springer, Berlin, 1997, pages 81-92
Schröder, Matthias, Effective Metrization of Regular Spaces, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 63-80
Schröder, Matthias, Spaces allowing type-2 complexity theory revisited, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 345-361
Schröder, Matthias, Admissible Representations in Computable Analysis, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 471-480
Schröder, Matthias, On the Relationship between Filter Spaces and Weak Limit Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 267-277
Schröder, Matthias and Steinberg, Florian and Ziegler, Martin, Average-case bit-complexity theory of real functions, in: Kotsireas, Ilias S. and Rump, Siegfried M. and Yap, Chee K. (eds.), Mathematical aspects of computer and information sciences, vol. 9582 of Lecture Notes in Computer Science, Springer, Cham, 2016, pages 505-519
Schröder, Matthias, An Effective Tietze-Urysohn Theorem for QCB-Spaces (Extended Abstract), in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 231-242
Schröder, Matthias, Admissible Representations of Limit Spaces, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 273-295
Schröder, Matthias, Admissible representations of probability measures, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 61-78
Schröder, Matthias, An effective Tietze-Urysohn theorem for QCB-spaces, Journal of Universal Computer Science15:6 (2009) 1317-1336
Schröder, Matthias, A note on closed subsets in quasi-zero-dimensional Qcb-spaces, J.UCS16:18 (2010) 2711-2732
Schröder, Matthias, The Coincidence Problem in Computable Analysis, Habilitation Thesis, Department of Mathematics, University of Darmstadt, Darmstadt, Germany, 2016
Schröder, Matthias, Admissibly Represented Spaces and Qcb-Spaces, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 305-346
Schröder, Matthias and Selivanov, Victor, Hyperprojective hierarchy of qcb_0-spaces, in: Beckmann, Arnold and Csuhaj-Varjú, Erzsébet and Meer, Klaus (eds.), Language, life, limits, vol. 8493 of Lecture Notes in Comput. Sci., Springer, Cham, 2014, pages 352-361
Schulz, Holger, Type 2 Theory of Effectivity and Real PCF, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 81-90
Schuster, Peter, Elementary choiceless constructive analysis, in: Clote, Peter G. and Schwichtenberg, Helmut (eds.), Computer Science Logic, vol. 1862 of Lecture Notes in Computer Science, Springer, Berlin, 2000, pages 512-526
Schuster, Peter, A constructive look at generalized Cauchy reals, Mathematical Logic Quarterly46:1 (2000) 125-134
Schuster, Peter, What is Continuity, Constructively?, Journal of Universal Computer Science11:12 (2005) 2076-2085
Schuster, Peter, Problems as Solutions, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 676-684
Schuster, Peter and Berger, Ulrich and Osswald, Horst (eds.), Reuniting the Antipodes - Constructive and Nonstandard Views of the Continuum, Proceedings of the symposium held in Venice, May 16-22, 1999, vol. 306 of Synthese Library, Kluwer Academic Publishers, Dordrecht, 2001
Schuster, Peter and Vîţă, Luminiţa and Bridges, Douglas S., Apartness as a Relation Between Subsets, in: Calude, C.S. and Dinneen, M.J. and Sburlan, S. (eds.), Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, London, 2001, pages 203-214
Schuster, Peter and Vîţă, Luminiţa and Bridges, Douglas S., Strong versus uniform continuity: a constructive round, Quaestiones Mathematicae26:2 (2003) 171-190
Schuster, Peter M., Unique existence, approximate solutions, and countable choice, Theoretical Computer Science305 (2003) 433-455
Schwichtenberg, Helmut, A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis, Journal of Universal Computer Science11:12 (2005) 2086-2095
Schwichtenberg, Helmut, Inverting Monotone Continuous Functions in Constructive Analysis, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 490-504
Scott, Dana, Extending the topological interpretation to intuitionistic analysis, Compositio Mathematica20 (1968) 194-210
Scott, Dana, Extending the topological interpretation to intuitionistic analysis. II, in: Kino, A. and Myhill, J. and Vesley, R. E. (eds.), Intuitionism and Proof Theory (Proc. Conf., Buffalo, N.Y., 1968), vol. 60 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1970, pages 235-255
Selinger, Nikita and Yampolsky, Michael, Constructive geometrization of Thurston maps, C. R. Math. Acad. Sci. Soc. R. Can.37:3 (2015) 100-113
Selivanov, V. L., Effective Wadge hierarchy in computable quasi-Polish spaces, Siberian Electronic Mathematical Reports18:1 (2021) 121-135
Selivanov, Victor, On the Difference Hierarchy in Countably Based T_0-Spaces, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 257-269
Selivanov, Victor, On the Wadge Reducibility of k-Partitions, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 59-71
Selivanov, Victor, Total Representations, Logical Methods in Computer Science9 (2013) 2:5, 30
Selivanov, Victor, Towards the Effective Descriptive Set Theory, in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 324-333
Selivanov, Victor, Well-quasi orders and hierarchy theory, in: Well-quasi orders in computation, logic, language and reasoning–a unifying concept of proof theory, automata theory, formal languages and descriptive set theory, vol. 53 of Trends Log. Stud. Log. Libr., Springer, Cham, 2020, pages 271-319
Selivanov, Victor, Non-collapse of the Effective Wadge Hierarchy, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 407-416
Selivanov, Victor, Non-collapse of the effective Wadge hierarchy, in: Connecting with computability, vol. 12813 of Lecture Notes in Comput. Sci., Springer, Cham, 2021, pages 407-416
Selivanov, Victor and Selivanova, Svetlana, Primitive recursive ordered fields and some applications, in: Computer algebra in scientific computing, vol. 12865 of Lecture Notes in Comput. Sci., Springer, Cham, 2021, pages 353-369
Selivanov, Victor L., Variations on Wadge Reducibility (Extended Abstract), in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 159-171
Selivanov, Victor L., Hierarchies in φ-spaces and applications, Mathematical Logic Quarterly51:1 (2005) 45-61
Selivanov, Victor L., Variations on the Wadge reducibility, Siberian Advances in Math.15:3 (2005) 44-80
Selivanov, Victor L., Classifying countable Boolean terms, Algebra and Logic44:2 (2005) 95-108
Selivanov, Victor L., Extending Wadge Theory to k-Partitions, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 387-399
Selivanova, Svetlana and Selivanov, Victor, Computing Solutions of Symmetric Hyperbolic Systems of PDE's, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 243-255
Semmes, Brian Thomas, A Game for the Borel Functions, Ph.D. thesis, Institute for Logic, Language and Computation, University of Amsterdam, 2009
Shepherdson, J.C., On the definition of computable function of a real variable, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik22 (1976) 391-402
Shioji, Naoki and Tanaka, Kazuyuki, Fixed Point Theory in Weak Second-Order Arithmetic, Annals of Pure and Applied Logic47 (1990) 167-188
Shoenfield, J.R., On degrees of unsolvability, Ann. of Math.69:2 (1959) 644-653
Skandalis, Kostas, Programmability in the set of real numbers and second-order recursion, Fundamenta Informaticae6:3-4 (1983) 257-274
Skandalis, Kostas, Programmable real numbers and functions, Fundamenta Informaticae7:1 (1984) 27-56
Skandalis, Kostas, Non-Recursiveness of the Operations on Real Numbers, Theoretical Computer Science71 (1990) 425-429
Skandalis, Kostas, Program computability over the real numbers, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 55-63
Skordev, Dimiter, Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 296-309
Skordev, Dimiter, Computability of Real Numbers by Using a Given Class of Functions in the Set of Natural Numbers, Mathematical Logic Quarterly48:Suppl. 1 (2002) 91-106
Skordev, Dimiter, Some subrecursive versions of Grzegorczyk's Uniformity Theorem, Mathematical Logic Quarterly50:4,5 (2004) 520-524
Skordev, Dimiter, E^2-computability of e, π and other famous constants, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 37-47
Skordev, Dimiter, Uniform computability of real functions, in: 120 Years Faculty of Mathematics and Informatics, St. Kliment Ohridski University of Sofia, Proceedings, St. Kliment Ohridski University Press, Sofia, 2011, pages 179-185
Skordev, Dimiter and Georgiev, Ivan, On a relative computability notion for real functions, in: Models of computation in context, vol. 6735 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2011, pages 270-279
Skordev, Dimiter and Weiermann, Andreas and Georgiev, Ivan, M^2-computable real numbers, J. Logic Comput.22:4 (2012) 899-925
Slisenko, A.O., Examples of a nondiscontinuous but not continuous constructive operator in a metric space (Russian), Trudy Mat. Inst. Steklov72 (1964) 524-532
Soare, R.I., Recursion theory and Dedekind cuts, Trans. Amer. Math. Soc.140 (1969) 271-294
Soare, R.I., Cohesive sets and recursively enumerable Dedekind cuts, Pacific J. Math.31 (1969) 215-231
Sofroniou, Mark and Spaletta, Giulia, Precise numerical computation, The Journal of Logic and Algebraic Programming64 (2005) 113-134
Solomon, Reed, Computable Reductions and Reverse Mathematics, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 182-191
Spandl, Christoph, Computing the topological entropy of shifts, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 131-155
Spandl, Christoph, Computability of Topological Pressure for Shifts of Finite Type with Applications in Statistical Physics, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 385-401
Specker, Ernst, Nicht konstruktiv beweisbare Sätze der Analysis, The Journal of Symbolic Logic14:3 (1949) 145-158
Specker, Ernst, Der Satz vom Maximum in der rekursiven Analysis, in: Heyting, A. (ed.), Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pages 254-265
Specker, Ernst, The fundamental theorem of algebra in recursive analysis, in: Dejon, B. and Henrici, P. (eds.), Constructive Aspects of the Fundamental Theorem of Algebra, Wiley-Interscience, London, 1969, pages 321-329
Spitters, Bas, Located Operators, Mathematical Logic Quarterly48:Suppl. 1 (2002) 107-122
Spitters, Bas, Constructive and intuitionistic integration theory and functional analysis, PhD thesis, University of Nijmegen, 2002
Spitters, Bas, Constructive Results on Operator Algebras, Journal of Universal Computer Science11:12 (2005) 2096-2113
Spitters, Bas, A constructive view on ergodic theorems, The Journal of Symbolic Logic71:2 (2006) 611-623
Spitters, Bas and Veldman, Wim, A constructive converse of the mean value theorem, Indagationes Mathematicae11:1 (2000) 151-157
Spreen, Dieter, Computable one-to-one enumerations of effective domains, in: Main, M. and Melton, A. and Mislove, M. and Schmidt, D. (eds.), Mathematical foundations of programming language semantics, vol. 298 of Lecture Notes in Computer Science, Springer, Berlin, 1988, pages 372-384
Spreen, Dieter, A characterization of effective topological spaces, in: Ambos-Spies, K. and Müller, G. H. and Sacks, G. E. (eds.), Recursion theory week, vol. 1432 of Lecture Notes in Mathematics, Springer, Berlin, 1990, pages 363-387
Spreen, Dieter, Computable one-to-one enumerations of effective domains, Information and Computation84 (1990) 26-46
Spreen, Dieter, A characterization of effective topological spaces II, in: Topology and category theory in computer science, Oxford Univ. Press, New York, 1991, pages 231-255
Spreen, Dieter, Effective operators and continuity revisited, in: Nerode, A. and Taĭtslin, M. (eds.), Logical foundations of computer science, vol. 620 of Lecture Notes in Computer Science, Springer, Berlin, 1992, pages 459-469
Spreen, Dieter, On Some Decision Problems in Programming, Information and Computation122:1 (1995) 120-139
Spreen, Dieter, Effective inseparability in a topological setting, Annals of Pure and Applied Logic80 (1996) 257-275
Spreen, Dieter, On Effective Topological Spaces, The Journal of Symbolic Logic63:1 (1998) 185-221
Spreen, Dieter, Representations versus numberings: on the relationship of two computability notions, Theoretical Computer Science262 (2001) 473-499
Spreen, Dieter, Can partial indexings be totalized?, The Journal of Symbolic Logic66:3 (2001) 1157-1185
Spreen, Dieter, Strong reducibilities for partial numberings, Archive for Mathematical Logic44:3 (2005) 209-217
Spreen, Dieter, On the Continuity of Effective Multifunctions, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 271-286
Spreen, Dieter, On some problems in computable topology, in: Logic Colloquium 2005, vol. 28 of Lect. Notes Log., Assoc. Symbol. Logic, Urbana, IL, 2008, pages 221-254
Spreen, Dieter and Schulz, Holger, On the equivalence of some approaches to computability on the real line, in: Keimel, Klaus and Zhang, Guo-Qiang and Liu, Ying Ming and Chen, Yixiang (eds.), Domains and processes, vol. 1 of Semantics Structures in Computation, Kluwer, Dordrecht, 2001, pages 67-101
Spreen, Dieter and Young, Paul, Effective operators in a topological setting, in: Richter, M.M. and Börger, E. and Oberschelp, W. and Schinzel, B. and Thomas, W. (eds.), Computation and Proof Theory, vol. 1104 of Lecture Notes in Mathematics, Springer, Berlin, 1984, pages 437-451
Staiger, Ludwig, The Kolmogorov Complexity of Real Numbers, in: Ciobanu, G. and Paun, Gh. (eds.), Fundamentals of Computation Theory, vol. 1684 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pages 536-546
Staiger, Ludwig, How Large is the Set of Disjunctive Sequences?, Journal of Universal Computer Science8:2 (2002) 348-362
Staiger, Ludwig, The Kolmogorov complexity of real numbers, Theoretical Computer Science284:2 (2002) 455-466
Staiger, Ludwig, On Oscillation-free ε-random Sequences, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 287-297
Steifer, Tomasz, Simple Betting and Stochasticity, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 424-433
Steinberg, Florian and Théry, Laurent and Thies, Holger, Quantitative continuity and computable analysis in Coq, in: 10th International Conference on Interactive Theorem Proving, vol. 141 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2019, page Art. No. 28, 21
Stephan, Frank and Wu, Guohua, Presentations of K-Trivial Reals and Kolmogorov Complexity, in: Cooper, S. Barry and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, vol. 3526 of Lecture Notes in Computer Science, Springer, 2005, pages 461-469
Stewart, Kristian Jon, Concrete and Abstract Models of Computation over Metric Algebras, PhD thesis, University of Wales Swansea, Singleton Park, Swansea, SA2 8PP, UK, 1999
Stoltenberg-Hansen, Viggo and Tucker, John V., Effective Algebras, in: Abramsky, S. and Gabbay, D.M. and Maibaum, T.S.E. (eds.), Handbook of Logic in Computer Science, Volume 4, Clarendon Press, Oxford, 1995, pages 357-527
Stoltenberg-Hansen, Viggo and Tucker, John V., Concrete models of computation for topological algebras, Theoretical Computer Science219 (1999) 347-378
Stoltenberg-Hansen, Viggo and Tucker, John V., Computable and continuous partial homomorphisms on metric partial algebras, Bulletin of Symbolic Logic9:3 (2003) 299-334
Stull, Donald M., Results on the Dimension Spectra of Planar Lines, in: Potapov, Igor and Spirakis, Paul and Worrell, James (eds.), 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), vol. 117 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pages 79:1-79:15
Stull, Donald M., Resource bounded randomness and its applications, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 301-348
Sun, Shu Ming and Zhong, Ning and Ziegler, Martin, On Computability of Navier-Stokes' Equation, in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 334-342
Sünderhauf, Philipp, Discrete Approximation of Spaces, A Uniform Approach to Topologically Structured Datatypes and their Function Spaces, PhD thesis, Fachbereich Mathematik, Technische Hochschule Darmstadt, Darmstadt, Germany, 1994
Sünderhauf, Philipp, A faithful computational model of the real numbers, Theoretical Computer Science151 (1995) 277-294
Tadaki, Kohtaro, Upper bound by Kolmogorov complexity for the probability in computable quantum measurement, in: Daumas, Marc et al. (eds.), RNC'5 Real Numbers and Computers, 2003, pages 193-214
Tadaki, Kohtaro, An extension of Chaitin's halting probability Ω to measurement operator in infinite dimensional quantum system, in: Frougny, Christiane and Brattka, Vasco and Müller, Norbert (eds.), RNC'6 Real Numbers and Computers, 2004, pages 172-191
Takeuti, Izumi, Effective Fixed Point Theorem Over a Non-computably Separable Metric Space, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 310-322
Takeuti, Izumi, Effective Limit in Computable Analysis, in: Daumas, Marc et al. (eds.), RNC'5 Real Numbers and Computers, 2003, pages 161-175
Takeuti, Izumi, Transition Systems over Continuous Time-Space, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 173-186
Tanaka, Yasuhito, Equivalence between an approximate version of Brouwer's fixed point theorem and Sperner's lemma: a constructive analysis, Appl. Math. E-Notes11 (2011) 238-243
Tanaka, Yasuhito, A proof of constructive version of Brouwer's fixed point theorem with uniform sequential continuity, ISRN Appl. Math. (2011) Art. ID 276040, 9
Tanaka, Yasuhito, Constructive proof of Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions, IAENG Int. J. Appl. Math.42:1 (2012) 1-6
Taylor, Paul, A lambda calculus for real analysis, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 227-266
Taylor, Paul, Foundations for Computable Topology, in: Sommaruga, Giovanni (ed.), Foundational Theories of Classical and Constructive Mathematics, vol. 76 of Western Ontario Series in Philosophy of Science, Springer, Dordrecht, 2011, pages 265-310
Tent, Katrin and Ziegler, Martin, Computable functions of reals, Münster J. Math.3 (2010) 43-65
Terayama, Kei and Tsuiki, Hideki, A stream calculus of bottomed sequences for real number computation, in: Proceedings of the Twenty-Ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIX, vol. 298 of Electron. Notes Theor. Comput. Sci., Elsevier Sci. B. V., Amsterdam, 2013, pages 383-402
Terwijn, Sebastiaan A., Learning and computing in the limit, in: Logic Colloquium '02, vol. 27 of Lect. Notes Log., Assoc. Symbol. Logic, La Jolla, CA, 2006, pages 349-359
Terwijn, Sebastiaan Augustinus, Computability and Measure, PhD thesis, Institute for Logic, Language and Computation, University Amsterdam, 1998
Theobald, Konrad R., Eine allgemeine Theorie der Stetigkeit und Berechenbarkeit für natürliche Halbordnungen, PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984
Towsner, Henry, Algorithmic randomness in ergodic theory, in: Franklin, Johanna N.Y. and Porter, Christopher P. (eds.), Algorithmic Randomness: Progress and Prospects, vol. 50 of Lecture Notes in Logic, Cambridge University Press, 2020, pages 40-57
Troelstra, A.S., Models and computability, in: Troelstra, A.S. (ed.), Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, vol. 344 of Lecture Notes in Mathematics, 1973, pages 97-174
Troelstra, A.S., A note on non-extensional operations in connection with continuity and recursivness, Nederl. Akad. Wetensch. Proc. Ser. A39 (1977) 455-462
Troelstra, A.S., Intuitionistic extensions of the reals, Nieuw Arch. Wisk.28 (1980) 63-113
Troelstra, A.S., Intuitionistic extensions of the reals, II, in: Logic Colloq. '80, vol. 108 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1980
Troelstra, A.S., Comparing the theory of representations and constructive mathematics, in: Börger, E. and Jäger, G. and Kleine Büning, H. and Richter, M.M. (eds.), Computer Science Logic, vol. 626 of Lecture Notes in Computer Science, Springer, Berlin, 1992, pages 382-395
Troelstra, A.S., An intuitionistic look at the real numbers (Dutch), in: Summer course 1993: the real numbers, CWI Syllabi, 1993, pages 67-81
Troelstra, A.S. and van Dalen, D., Constructivism in Mathematics, Volume 1, vol. 121 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1988
Troelstra, A.S. and van Dalen, D., Constructivism in Mathematics, Volume 2, vol. 123 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1988
Tsuiki, Hideki, Grey Code Representation of Exact Real Numbers, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 91-102
Tsuiki, Hideki, Computational Dimension of Topological Spaces, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 323-335
Tsuiki, Hideki, Representations of Complete Uniform Spaces via Uniform Domains, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Tsuiki, Hideki, Real number computation through Gray code embedding, Theoretical Computer Science284:2 (2002) 467-485
Tsuiki, Hideki, Dyadic subbases and efficiency properties of the induced {0, 1, ⊥}^ω-representations, Topology Proceedings28:2 (2004) 673-687
Tsuiki, Hideki, Real number computation with committed choice logic programming languages, The Journal of Logic and Algebraic Programming64 (2005) 61-84
Tsuiki, Hideki and Yamada, Shuji, On Finite-time Computability Preserving Conversions, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 299-308
Tsujii, Yoshiki and Yasugi, Mariko and Mori, Takakazu, Some Properties of the Effective Uniform Topological Space, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 336-356
Tsujii, Yoshiki and Yasugi, Mariko and Mori, Takakazu, Sequential Computability of a Function: Diagonal Space and Limiting Recursion, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 187-199
Tucker, J. V. and Zucker, J. I., Computability of operators on continuous and discrete time streams, Computability3:1 (2014) 9-44
Tucker, J. V. and Zucker, J. I., Generalizing computability theory to abstract algebras, in: Sommaruga, Giovanni and Strahm, Thomas (eds.), Turing's Revolution, Birkhäuser/Springer, Cham, 2015, pages 127-160
Tucker, J.V. and Zucker, J.I., Examples of semicomputable sets of real and complex numbers, in: Myers, J.P. and O'Donnell, M.J. (eds.), Constructivity in computer science, Springer, Berlin, 1992, pages 179-198
Tucker, J.V. and Zucker, J.I., Computation by 'While' Programs on Topological Partial Algebras, Theoretical Computer Science219 (1999) 379-420
Tucker, J.V. and Zucker, J.I., Computable Functions and Semicomputable Sets on Many-Sorted Algebras, in: Abramsky, S. and Gabbay, D.M. and Maibaum, T.S.E. (eds.), Handbook of Logic in Computer Science, Volume 5, Oxford University Press, Oxford, 2000, pages 317-523
Tucker, J.V. and Zucker, J.I., Abstract computability and algebraic specification, ACM Transactions on Computational Logic3:2 (2002) 279-333
Tucker, J.V. and Zucker, J.I., Abstract versus concrete computation on metric partial algebras, ACM Transactions on Computational Logic5:4 (2004) 611-668
Tucker, J.V. and Zucker, J.I., Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, The Journal of Logic and Algebraic Programming62 (2005) 71-108
Tucker, John V. and Zucker, Jeffery I., A Network Model of Analogoue Computation over Metric Algebras, in: Cooper, Barry S. and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 515-529
Turing, Alan M., On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society42:2 (1937) 230-265
Turing, Alan M., On computable numbers, with an application to the Entscheidungsproblem. A correction., Proceedings of the London Mathematical Society43:2 (1938) 544-546
Uspensky, V.A., Lectures on Computable Functions (Russian), Mathematical Logic and the Foundations of Mathematics, Fiz-MatGiz, Moscow, 1960
Uspensky, V.A., On the relation between various systems of constructive real numbers (Russian), Izv. Vyš. Učebn. Zaved\. Matematika :2(15) (1960) 199-208
van Atten, Mark and van Dalen, Dirk, Arguments for the Continuity Principle, Bulletin of Symbolic Logic8:3 (2002) 329-347
van Dalen, D., An interpretation of intuitionistic analysis, Ann. Math. Logic13 (1978) 1-43
van Dalen, Dirk, Lectures on Intuitionism, in: Mathais, A. R. D. and Rogers, H. (eds.), Cambridge Summer School in Mathematical Logic, Lecture Notes in Mathematics, 1973, pages 1-94
van Dalen, Dirk, How the Mathematical Objects Determine the Mathematical Principles, Journal of Universal Computer Science11:12 (2005) 2132-2141
van der Hoeven, Joris, Effective Real Numbers in Mmxlib, in: Dumas, Jean-Guillaume (ed.), International Conference on Symbolic and Algebraic Computation, ACM Press, 2006, pages 138-145
van der Hoeven, Joris, Computations with effective real numbers, Theoretical Computer Science351:1 (2006) 52-60
van Lambalgen, Michiel, Random sequences, Ph.D. thesis, Department of Mathematics, University of Amsterdam, 1987
Vaĭnberg, Ju. R. and Nogina, Elena Ju., Categories of effectively topological spaces, in: Studies in formalized languages and nonclassical logics (Russian), Izdat. "Nauka", Moscow, 1974, pages 253-273
Vaĭnberg, Ju. R. and Nogina, Elena Ju., Two types of continuity of computable mappings of numerated topological spaces, in: Studies in the theory of algorithms and mathematical logic, Vol. 2 (Russian), Vyčisl. Centr Akad. Nauk SSSR, Moscow, 1976, pages 84-99, 159
Veldman, W., Investigations in Intuitionistic Hierarchy Theory, PhD thesis, Katholieke Universiteit, Nijmegen, Nijmegen, The Netherlands, 1981
Vîţă, Luminiţa and Bridges, Douglas S., More on Cauchy nets in apartness spaces, Scientiae Mathematicae Japonicae59:3 (2004) 547-552
Vîţă, Luminiţa S. and Bridges, Douglas S., A constructive theory of point-set nearness, Theoretical Computer Science305 (2003) 473-489
Vîţă, Luminiţa Simona, A Constructive Development of Operator Algebra Theory, PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2000
Vîţă, Luminiţa Simona, On Complements of Sets and the Efremovič Condition in Pre-apartness Spaces, Journal of Universal Computer Science11:12 (2005) 2159-2164
Waaldijk, Frank, Modern Intuitionistic Topology, PhD thesis, Radboud University Nijmegen, 1996
Wagner, Klaus, Arithmetische Operatoren, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik22 (1976) 553-570
Wagner, Klaus, Arithmetische und Bairesche Operatoren, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik23 (1977) 181-191
Wang, Hao, Specker's mathematical work from 1949 to 1979, in: Logic and Algorithmic (Zürich, 1980), Univ. Geneva, 1982, pages 11-24
Wang, Michael Yuchuan, Constructive Analysis of Partial Differential Equations, PhD thesis, Department of Mathematics, University of Waikato, Hamilton, New Zealand, 1997
Washihara, Masako, Computability and Fréchet spaces, Mathematica Japonica42:1 (1995) 1-13
Washihara, Masako, Computability and tempered distributions, Mathematica Japonica50:1 (1999) 1-7
Washihara, Masako and Yasugi, Mariko, Computability and metrics in a Fréchet space, Mathematica Japonica43:3 (1996) 431-443
Weihrauch, Klaus, A generalized computability thesis, in: Karpinski, Marek (ed.), Fundamentals of Computation Theory, vol. 56 of Lecture Notes in Computer Science, Springer, 1977, pages 538-542
Weihrauch, Klaus, Recursion and complexity theory on cpo-s, in: Deussen, Peter (ed.), Theoretical Computer Science, vol. 104 of Lecture Notes in Computer Science, Springer, 1981
Weihrauch, Klaus, A Foundation for Computable Analysis, in: Bridges, Douglas S. and Calude, Cristian S. and Gibbons, Jeremy and Reeves, Steve and Witten, Ian H. (eds.), Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pages 66-89
Weihrauch, Klaus, A Refined Model of Computation for Continuous Problems, Journal of Complexity14 (1998) 102-121
Weihrauch, Klaus, Computability on the probability measures on the Borel sets of the unit interval, Theoretical Computer Science219 (1999) 421-437
Weihrauch, Klaus, On Computable Metric Spaces Tietze-Urysohn Extension is Computable, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 357-368
Weihrauch, Klaus, Computable Analysis, in: B.D. Masurov et al. (eds.), Proceedings of the international conference "Logic and Applications" honouring Yu. L. Ershov on his 60th birthday, University of Novosibirsk, Novosibirsk, 2002, pages 165-178
Weihrauch, Klaus, Continuity in computable analysis (Abstract), in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 99-100
Weihrauch, Klaus, Multi-functions on multi-represented sets are closed under flowchart programming, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 267-300
Weihrauch, Klaus and Grubba, Tanja, Elementary computable topology, Journal of Universal Computer Science15:6 (2009) 1381-1422
Weihrauch, Klaus and Kreitz, Christoph, Representations of the real numbers and of the open subsets of the set of real numbers, Annals of Pure and Applied Logic35 (1987) 247-260
Weihrauch, Klaus and Kreitz, Christoph, Type 2 computational complexity of functions on Cantor's space, Theoretical Computer Science82 (1991) 1-18
Weihrauch, Klaus and Schreiber, Ulrich, Metric spaces defined by weighted algebraic cpo-s, in: Budach, Lothar (ed.), Fundamentals of Computation Theory, FCT'79, Akademie-Verlag, Berlin, 1979, pages 516-522
Weihrauch, Klaus and Schreiber, Ulrich, Embedding metric spaces into cpo's, Theoretical Computer Science16 (1981) 5-24
Weihrauch, Klaus and Schäfer, Giesela, Admissible representations of effective cpo's, in: Gruska, J. and Chytil, M. (eds.), Mathematical Foundations of Computer Science 1981, vol. 118 of Lecture Notes in Computer Science, Springer, 1981
Weihrauch, Klaus and Schäfer, G., Admissible representations of effective cpo's, Theoretical Computer Science26 (1983) 131-147
Weihrauch, Klaus and Zheng, Xizhong, Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions, in: Jiang, Tao and Lee, D.T. (eds.), Computing and Combinatorics, vol. 1276 of Lecture Notes in Computer Science, Springer, Berlin, 1997, pages 166-175
Weihrauch, Klaus and Zheng, Xizhong, A Finite Hierarchy of the Recursively Enumerable Real Numbers, in: Brim, Luboš and Gruska, Jozef and Zlatuška, Jiří (eds.), Mathematical Foundations of Computer Science 1998, vol. 1450 of Lecture Notes in Computer Science, Springer, Berlin, 1998, pages 798-806
Weihrauch, Klaus and Zheng, Xizhong, Effectiveness of the global modulus of continuity on metric spaces, Theoretical Computer Science219 (1999) 439-450
Weihrauch, Klaus and Zheng, Xizhong, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, Theoretical Computer Science234 (2000) 109-133
Weihrauch, Klaus and Zhong, Ning, The Wave Propagator is Turing Computable, in: Wiedermann, Jiří and van Emde Boas, Peter and Nielsen, Mogens (eds.), Automata, Languages and Programming, vol. 1644 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pages 697-706
Weihrauch, Klaus and Zhong, Ning, Is the Linear Schrödinger Propagator Turing Computable?, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 369-377
Weihrauch, Klaus and Zhong, Ning, Turing Computability of a Nonlinear Schrödinger Propagator, in: Wang, Jie (ed.), Computing and Combinatorics, vol. 2108 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 596-599
Weihrauch, Klaus and Zhong, Ning, The Solution Operator of the Korteweg-de Vries Equation is Computable, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Weihrauch, Klaus and Zhong, Ning, Is wave propagation computable or can wave computers beat the Turing machine?, Proceedings of the London Mathematical Society85:2 (2002) 312-332
Weihrauch, Klaus and Zhong, Ning, An Algorithm for Computing Fundamental Solutions, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 201-215
Weihrauch, Klaus and Zhong, Ning, Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines, Theoretical Computer Science332:1-3 (2005) 337-366
Weihrauch, Klaus and Zhong, Ning, An algorithm for computing fundamental solutions, SIAM Journal on Computing35:6 (2006) 1283-1294
Weihrauch, Klaus and Zhong, Ning, Computable analysis of the abstract Cauchy problem in a Banach space and its applications (I), in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 33-59
Weinberger, Shmuel, Computers, Rigidity, and Moduli: The Large-Scale Fractal Geometry of Riemannian Moduli Space, Princeton University Press, New Jersey, 2004
Wiedermann, Jiří and van Leeuwen, Jan, Relativistic Computers and Non-uniform Complexity Theory, in: Calude, Cristian S. and Dinneen, Michael J. and Peper, Ferdinand (eds.), Unconventional models of computation, vol. 2509 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 287-299
Wiedmer, E., Computing with infinite objects, Theoretical Computer Science10 (1980) 133-155
Xu, Yatao and Grubba, Tanja, Computability on Subsets of Locally Compact Spaces, in: Cai, J.-Y. and Cooper, S.B. and Zhu, H. (eds.), Theory and Applications of Models of Computation, vol. 4484 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 100-114
Yamakawa, Takeshi and Kreinovich, Vladik, Why fundamental physical equations are of second order?, International Journal of Theoretical Physics38:6 (1999) 1763-1770
Yasugi, Mariko, Computability in analysis, Surikaisekikenkyusho-Kokyuroku850 (1993) 207-214
Yasugi, Mariko, Computability problem of Gaussian function, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 157-165
Yasugi, Mariko, How to understand the computability aspects of step functions, Sūrikaisekikenkyūsho Kōkyūroku1169 (2000) 84-91
Yasugi, Mariko and Brattka, Vasco and Washihara, Masako, Computability aspects of some discontinuous functions, Scientiae Mathematicae Japonicae55:3 (2002) 427-441
Yasugi, Mariko and Brattka, Vasco and Washihara, Masako, Limit computation of some discontinuous functions, in: Theoretical development and feasibility of mathematical analysis on the computer, vol. 1286 of Sūrikaisekikenkyūsho Kōkyūroku, Research Institute for Mathematical Sciences, Kyoto, 2002, pages 79-84
Yasugi, Mariko and Mori, Takakazu and Tsujii, Yoshiki, Effective properties of sets and functions in metric spaces with computability structure, Theoretical Computer Science219 (1999) 467-486
Yasugi, Mariko and Mori, Takakazu and Tsujii, Yoshiki, Effective sequence of uniformities and its effective limit, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 301-318
Yasugi, Mariko and Tsujii, Yoshiki, Two Notions of Sequential Computability of a Function with Jumps, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Yasugi, Mariko and Tsujii, Yoshiki, Computability of a function with jumps - Effective uniformity and limiting recursion, Topology and its Applications146-147 (2005) 563-582
Yasugi, Mariko and Tsujii, Yoshiki and Mori, Takakazu, Metrization of the Uniform Space and Effective Convergence, Mathematical Logic Quarterly48:Suppl. 1 (2002) 123-130
Yasugi, Mariko and Tsujii, Yoshiki and Mori, Takakazu, Sequential Computability of a Function. Effective Fine Space and Limiting Recursion, Journal of Universal Computer Science11:12 (2005) 2179-2191
Yasugi, Mariko and Tsujii, Yoshiki and Mori, Takakazu, Irrational-based computability of functions, in: Arai, Toshiyasu and Kikuchi, Makoto and Kuroda, Satoru and Okada, Mitsuhiro and Yorioka, Teruyuki (eds.), Advances in mathematical logic, vol. 369 of Springer Proc. Math. Stat., Springer, Singapore, 2021, pages 181-204
Yasugi, Mariko and Tsujii, Yoshiki and Mori, Takakazu, A effective study of continued ractions and applications, in: Ikeda, Kazuma (ed.), Theory and Applications of Proof and Computation, vol. 2228 of RIMS Kôky\^uroku, Research Institute for Mathematical Sciences, Kyoto, 2022, pages 168-185
Yasugi, Mariko and Washihara, Masako, A note on Rademacher Functions and Computability, in: Ito, Masami and Imaoka, Teruo (eds.), Words, Languages & Combinatorics III, World Scientific Publishing, Singapore, 2003, pages 466-475
Yasugi, Mariko and Washihara, Masako, Sequential computability of a function–limiting recursion versus effective uniformity–to the memory of Marian Boykan Pour-El, Sci. Math. Jpn.71:3 (2010) 331-341
Ye, Feng, Toward a constructive theory of unbounded linear operators, The Journal of Symbolic Logic65:1 (2000) 357-370
Yongcheng Wu and Klaus Weihrauch, A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 217-230
Yoshida, Satoru, The constructive completion of the space D(R), Mathematical Logic Quarterly51:1 (2005) 77-82
Yoshikawa, Atsushi, On an ad hoc computability structure in a Hilbert space, Proc. Japan Acad. Ser. A79:3 (2003) 65-70
Yoshikawa, Atsushi, On computability of the Galerkin procedure, Proc. Japan Acad. Ser. A83:5 (2007) 69-72
Yu, Fuxiang, On the complexity of the pancake problem, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 95-115
Yuen, Henry, Einstein Meets Turing: The Computability of Nonlocal Games, in: De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fernández-Duque, David (eds.), Connecting with Computability, Springer, Cham, 2021, pages 483-493
Zahn, Peter, Ein konstruktiver Weg zur Maßtheorie und Funktionalanalysis, Wissenschaftliche Buchgesellschaft, Darmstadt, 1978
Zahn, Peter, Gilt das Lemma von König "konstruktiv"?, Archiv für Mathematische Logik und Grundlagenforschung25 (1985) 33-35
Zaslavskiĭ, I. D. and Manukjan, S. N., Partitionings of the plane by constructive curves, Trudy Vyčisl. Centra Akad. Nauk Armjan. SSR i Erevan. Gos. Univ.5 (1968) 26-138
Zaslavskiĭ, Igor D., Disproof of some theorems of classical analysis in constructive analysis (Russian), Usp. Mat. Nauk10:4 (1955) 209-210
Zaslavskiĭ, Igor D., Some properties of constructive real numbers and constructive functions (Russian), Tr. Mat. Inst. Steklov67:4 (1962) 385-457
Zaslavskiĭ, Igor D., On the differentiation and integration of constructive functions (Russian), Doklady Akademii Nauk156 (1964) 25-27
Zaslavskiĭ, Igor D., Rectifiability of constructive plane curves (Russian), Izv. Akad. Nauk Armjan. SSR Ser. Mat.2 (1967) 69-82
Zhao, Xishun and Müller, Norbert, Complexity of Operators on Compact Sets, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 101-119
Zheng, Xizhong, Weak Computability and Semi-Computability in Analysis, PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1998
Zheng, Xizhong, Binary Enumerability of Real Numbers, in: Asana, Takao and Imai, Hiroshi and Lee, D.T. and Nakano, Shin-ichi and Tokuyama, Takeshi (eds.), Computing and Combinatorics, vol. 1627 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pages 300-309
Zheng, Xizhong, The closure properties on real numbers under limits and computable operators, Theoretical Computer Science284:2 (2002) 499-518
Zheng, Xizhong, Recursive Approximability of Real Numbers, Mathematical Logic Quarterly48:Suppl. 1 (2002) 131-156
Zheng, Xizhong, On the divergence bounded computable real numbers, in: Warnow, Tandy and Zhu, Binhai (eds.), Computing and Combinatorics, vol. 2697 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pages 102-111
Zheng, Xizhong, On the Turing degrees of weakly computable real numbers, Journal of Logic and Computation13:2 (2003) 159-172
Zheng, Xizhong, On the hierarchy of Δ^0_2-real numbers, in: Frougny, Christiane and Brattka, Vasco and Müller, Norbert (eds.), RNC'6 Real Numbers and Computers, 2004, pages 192-216
Zheng, Xizhong, A Computability Theory of Real Numbers, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 584-594
Zheng, Xizhong, Classification of the computable approximations by divergence boundings, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 325-344
Zheng, Xizhong, Finitely Bounded Effective Computability, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 255-265
Zheng, Xizhong, A hierarchy of computably enumerable reals, Fundamenta Informaticae83:1-2 (2008) 219-230
Zheng, Xizhong and Barmpalias, George, On the Monotonic Computability of Semi-computable Real Numbers, in: Calude, Cristian S. and Dinneen, Michael J. and Vajnovszki, Vincent (eds.), Discrete Mathematics and Theoretical Computer Science, vol. 2731 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pages 290-300
Zheng, Xizhong and Lub, Dianchen and Bao, Kejin, Divergence bounded computable real numbers, Theoretical Computer Science351:1 (2006) 27-38
Zheng, Xizhong and Rettinger, Robert, h-Monotonically computable real numbers, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 375-388
Zheng, Xizhong and Rettinger, Robert, Weak computability and representation of reals, Mathematical Logic Quarterly50:4,5 (2004) 431-442
Zheng, Xizhong and Rettinger, Robert, A Note On the Turing Degrees of Divergence Bounded Computable Reals, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 231-237
Zheng, Xizhong and Rettinger, Robert, On the extensions of Solovay Reducibility, in: Chwa, Kyung-Yong and Munro, J. Ian (eds.), Computing and Combinatorics, vol. 3106 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 360-369
Zheng, Xizhong and Rettinger, Robert, Effective Jordan decomposition, Theory of Computing Systems38:2 (2005) 189-209
Zheng, Xizhong and Rettinger, Robert, Point-separable classes of simple computable planar curves, Log. Methods Comput. Sci.8:3 (2012) 3:15, 19
Zheng, Xizhong and Rettinger, Robert and Gengler, Romain, Ershov's hierarchy of real numbers, in: Rovan, B. and Vojtas, P. (eds.), Mathematical Foundations of Computer Science 2003, vol. 2747 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pages 681-690
Zheng, Xizhong and Rettinger, Robert and Gengler, Romain, Closure properties of real number classes under CBV functions, Theory of Computing Systems38 (2005) 701-729
Zheng, Xizhong and Rettinger, Robert and von Braunmühl, Burchard, Effectively Absolute Continuity and Effective Jordan Decomposability, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
Zheng, Xizhong and Rettinger, Robert and von Braunmühl, Burchard, On the Effective Jordan Decomposability, in: Alt, Helmut and Habib, Michel (eds.), STACS 2003, vol. 2607 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pages 167-178
Zheng, Xizhong and Weihrauch, Klaus, The Arithmetical Hierarchy of Real Numbers, in: Kutyłowski, Mirosław and Pacholski, Leszek and Wierzbicki, Tomasz (eds.), Mathematical Foundations of Computer Science 1999, vol. 1672 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pages 23-33
Zheng, Xizhong and Weihrauch, Klaus, The Arithmetical Hierarchy of Real Numbers, Mathematical Logic Quarterly47:1 (2001) 51-65
Zhong, Ning, Effective Separation Axioms, Questions and Answers in General Topology14:2 (1996) 177-185
Zhong, Ning, Effective collectionwise Hausdorff and normal axioms, Questions and Answers in General Topology15:2 (1997) 225-230
Zhong, Ning, Recursively Enumerable Subsets of R^q In Two Computing Models: Blum-Shub-Smale Machine and Turing Machine, Theoretical Computer Science197 (1998) 79-94
Zhong, Ning, Computability structure of the Sobolev spaces and its applications, Theoretical Computer Science219 (1999) 487-510
Zhong, Ning, Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation, in: Cooper, S. Barry and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 552-561
Zhong, Ning and Weihrauch, Klaus, Computability theory of generalized functions, Journal of the Association for Computing Machinery50:4 (2003) 469-505
Zhong, Ning and Zhang, Bing-Yu, L^p-Computability, Mathematical Logic Quarterly45:4 (1999) 449-456
Zhou, Qing, Computability on open and closed subsets of Euclidean space, PhD thesis, University of Minnesota, Minneapolis, 1992
Zhou, Qing, Computable real-valued functions on recursive open and closed subsets of Euclidean space, Mathematical Logic Quarterly42 (1996) 379-409
Zhou, Qing, Subclasses of Computable Real Valued Functions, in: Jiang, Tao and Lee, D.T. (eds.), Computing and Combinatorics, vol. 1276 of Lecture Notes in Computer Science, Springer, Berlin, 1997, pages 156-165
Ziegler, Martin, Computability on Regular Subsets of Euclidean Space, Mathematical Logic Quarterly48:Suppl. 1 (2002) 157-181
Ziegler, Martin, Zur Berechenbarkeit reeller geometrischer Probleme, PhD thesis, Fachbereich Mathematik/Informatik, Universität Paderborn, Paderborn, 2002
Ziegler, Martin, Computable operators on regular sets, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 389-406
Ziegler, Martin, Stability versus Speed in a Computable Algebraic Model, in: Daumas, Marc et al. (eds.), RNC'5 Real Numbers and Computers, 2003, pages 47-64
Ziegler, Martin, Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism, in: Cooper, Barry S. and Löwe, Benedikt and Torenvliet, Leen (eds.), New Computational Paradigms, vol. 3526 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pages 562-571
Ziegler, Martin, Revising type-2 computation and degrees of discontinuity, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 255-274
Ziegler, Martin, (Short) Survey of Real Hypercomputation, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 809-824
Ziegler, Martin, Real Computability and Hypercomputation, Habilitation Thesis, Department of Computer Science, University of Paderborn, Paderborn, Germany, 2007
Ziegler, Martin and Brattka, Vasco, Computing the Dimension of Linear Subspaces, in: Hlaváč, Václav and Jeffery, Keith G. and Wiedermann, Jiří (eds.), SOFSEM 2000: Theory and Practice of Informatics, vol. 1963 of Lecture Notes in Computer Science, Springer, Berlin, 2000, pages 450-458
Ziegler, Martin and Brattka, Vasco, Turing Computability of (Non-)Linear Optimization, in: Therese Biedl (ed.), Thirteenth Canadian Conference on Computational Geometry, University of Waterloo, 2001, pages 181-184
Ziegler, Martin and Brattka, Vasco, A Computable Spectral Theorem, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 378-388
V'yugin, Vladimir V., Effective Convergence in Probability and an Ergodic Theorem for Individual Random Sequences, SIAM Theory of Probability and Its Applications42:1 (1997) 39-50
V'yugin, Vladimir V., Ergodic Theorems for Individual Random Sequences, Theoretical Computer Science207:4 (1998) 343-361
V'yugin, Vladimir V., Non-robustness property of the individual ergodic theorem, Problems of Information Transmission37:2 (2001) 27-39
Šanin, N.A., Some problems of mathematical analysis in the light of constructive logic, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik2 (1956) 27-36
Šanin, N.A., Constructive Real Numbers and Constructive Function Spaces, vol. 21 of Translations of Mathematical Monographs, American Mathematical Society, Providence, 1968
Šanin, N.A., A hierarchy of ways of understanding judgments in constructive mathematics (Russian), Trudy Mat. Inst. Steklov.129 (1973) 203-266
Šanin, N.A., The hierarchy of constructive Brouwer functionals (Russian), Zap. Naučn. Sem. Otdel. Mat. Inst. Steklov.40 (1974) 142-147
Šanin, N.A., Canonical recursive functions and operations (Russian), Zap. Naučn. Sem. Otdel. Mat. Inst. Steklov.88 (1979) 218-235,246-247
Šanin, N.A., Georg Cantor as the author of constructions that play fundamental roles in constructive mathematics (Russian), Zap. Naučn. Sem. Otdel. Mat. Inst. Steklov. POMI220 (1995) 5-22,246-145