Classified Bibliography

• Computability and Complexity in Analysis (based on classical logic),
• Intuitionistic and Constructive Analysis (Brouwer's and Bishop's school),
• Russian Constructive Analysis (Markov's school),
• Books on Related Topics.

• Oliver Aberth. Analysis in the computable number field. Journal of the Association for Computing Machinery, 15:275-299, 1968.

• Oliver Aberth. A chain of inclusion relations in computable analysis. Proceedings of the American Mathematical Society, 22:539-548, 1969.

• Oliver Aberth. Computable analysis and differential equations. In A. Kino, J. Myhill, and R.E. Vesley, editors, Intuitionism and Proof Theory, Studies in Logic and the Foundations of Mathematics, pages 47-52, Amsterdam, 1970. North-Holland. Proc. of the Summer Conf. at Buffalo N.Y. 1968.

• Oliver Aberth. The failure in computable analysis of a classical existence theorem for differential equations. Proceedings of the American Mathematical Society, 30:151-156, 1971.

• Oliver Aberth. Computable Analysis. McGraw-Hill, New York, 1980.

• Yohji Akama and Shinji Iizuka. Real number representations of graph-directed IFS attractors. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 3-24. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Yohji Akama. Limiting partial combinatory algebras. Theoretical Computer Science, 311:199-220, 2004.

• Klaus Ambos-Spies, Klaus Weihrauch, and Xizhong Zheng. Weakly computable real numbers. Journal of Complexity, 16(4):676-690, 2000.

• Klaus Ambos-Spies. A note on recursively approximable real numbers. Forschungsbericht Mathematische Logik 38, Universität Heidelberg, Heidelberg, 1998.

• Valentin V. Andreev, Dale Daniel, and Timothy H. McNicholl. Technical report: Computation on the extended complex plane and conformal mapping of multiply-connected domains. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 127-139. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, and Carl H. Smith. On the inductive inference of recursive real-valued functions. Theoretical Computer Science, 219:3-17, 1999.

• Margaret Archibald, Vasco Brattka, and Clemens Heuberger. Randomness with respect to the signed-digit representation. Fundamenta Informaticae, 83(1-2):1-19, 2008.

• Jeremy Avigad and Ksenija Simic. Fundamental notions of analysis in subsystems of second-order arithmetic. Annals of Pure and Applied Logic, 139:138-184, 2006.

• Jeremy Avigad. Weak theories of nonstandard arithmetic and analysis. In Stephen Simpson, editor, Reverse Mathematics 2001, Lecture Notes in Logic, pages 19-46, La Jolla, 2005. Association for Symbolic Logic.

• Serikzhan Badaev and Dieter Spreen. A note on partial numberings. Mathematical Logic Quarterly, 51(2):129-136, 2005.

• J.C. Baez. Recursivity in quantum mechanics. Trans. Amer. Math. Soc., 280:339-350, 1983.

• Stefan Banach and Stanislaw Mazur. Sur les fonctions calculables. Ann. Soc. Pol. de Math., 16:223, 1937.

• George Barmpalias and Antonio Montalbán. A cappable almost everywhere dominating computably enumerable degree. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 17-31, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• George Barmpalias, Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber. K-trivial closed sets and continuous functions. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 135-145, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber. Algorithmic randomness of continuous functions. Archive for Mathematical Logic, 46(7-8):533–--546, 2008.

• George Barmpalias, Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber. K-triviality of closed sets and continuous functions. Journal of Logic and Computation, 19(1):3-16, 2009.

• George Barmpalias. On 0'-computable reals. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• George Barmpalias. The approximation structure of a computably approximable real. The Journal of Symbolic Logic, 68(3):885-922, 2003.

• George Barmpalias. A transfinite hierarchy of reals. Mathematical Logic Quarterly, 49(2):163-172, 2003.

• George Barmpalias. Approximation representations for delta ₂ reals. Archive for Mathematical Logic, 43(8):947-964, 2004.

• George Barmpalias. Approximation representations for reals and their wtt-degrees. Mathematical Logic Quarterly, 50(4,5):370-380, 2004.

• Georgios Barmpalias. Computability and Applications to Analysis. PhD thesis, University of Leeds, School of Mathematics, Leeds, 2004.

• George Barmpalias. Random non-cupping revisited. Journal of Complexity, 22(6):850-857, 2006.

• Prashant Batra. Newton's method and the computational complexity of the fundamental theorem of algebra. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 201-218. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Andrej Bauer and Iztok Kavkler. Implementing real numbers with RZ. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 365-384. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Andrej Bauer and Alex Simpson. Locally non-compact spaces and continuity principles. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 103-116. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Andrej Bauer and Alex Simpson. Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability. Mathematical Logic Quarterly, 50(4,5):351-369, 2004.

• Andrej Bauer and Christopher A. Stone. RZ: A tool for bringing constructive and computable mathematics closer to programming practice. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 28-42, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Andrej Bauer and Christopher A. Stone. RZ: a tool for bringing constructive and computable mathematics closer to programming practice. Journal of Logic and Computation, 19(1):17-43, 2009.

• Andrej Bauer and Paul Taylor. The Dedekind reals in abstract Stone duality. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 25-64. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Andrej Bauer, Martín Hötzel Escardó, and Alex Simpson. Comparing functional paradigms for exact real-number computation. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 488-500, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.

• Andrej Bauer, Lars Birkedal, and Dana S. Scott. Equilogical spaces. Theoretical Computer Science, 315:35-59, 2004.

• Andrej Bauer. The Realizability Approach to Computable Analysis and Topology. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, 2000.

• Andrej Bauer. A relationship between equilogical spaces and type two effectivity. In Stephen Brooks and Michael Mislove, editors, Seventeenth Conference on the Mathematical Foundations of Programming Semantics, volume 45 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2001. Elsevier. MFPS 2001, Aarhus, Denmark May 23-26, 2001.

• Andrej Bauer. A relationship between equilogical spaces and type two effectivity. Mathematical Logic Quarterly, 48(Suppl. 1):1-15, 2002.

• Verónica Becher and Santiago Figueira. An example of a computable absolutely normal number. Theoretical Computer Science, 270:947-958, 2002.

• Verónica Becher and Serge Grigorieff. Recursion and topology on 2 ^{leq omega} for possibly infinite computations. Theoretical Computer Science, 322(1):85-136, 2004.

• Verónica Becher and Serge Grigorieff. Random reals á la Chaitin with or without prefix-freeness. Theoretical Computer Science, 385:193-201, 2007.

• Verónica Becher, Santiago Figueira, and Rafael Picchi. Turing’s unpublished algorithm for normal numbers. Theoretical Computer Science, 377(1-3):126-138, 2007.

• Benjamín René Callejas Bedregal and Benedito Melo Acióly. Effectively given continuous domains: A computable interval analysis. Electronic Journal on Mathematics of Computation, 0, 1999.

• Michael Beeson. Constructivity, computability, and the continuum. In Giandomenico Sica, editor, Essays on the Foundations of Mathematics and Logic, volume 2 of Advanced Studies in Mathematics and Logic, pages 9-37. Polimetrica, Milano, 2005.

• Edwin J. Beggs and John V. Tucker. Can Newtonian systems, bounded in space, time, mass and energy compute all functions? Theoretical Computer Science, 371:4-19, 2007.

• V. Benci, C. Bonanno, S. Galatolo, G. Menconi, and M. Virgilio. Dynamical systems and computable information. Discrete and Continuous Dynamical Systems B, 4(4):935-960, 2004.

• Yves Bertot. Affine functions and series with co-inductive real numbers. Mathematical Structures in Computer Science, 17:37-63, 2007.

• Laurent Bienvenu and Wolfgang Merkle. Effective randomness for computable probability measures. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 117-130, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• I. Binder, Mark Braverman, and M. Yampolsky. On computational complexity of Siegel Julia sets. Comm. Math. Phys., 264(2):317-334, 2006.

• Jens Blanck, Vasco Brattka, and Peter Hertling, editors. Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers.

• Jens Blanck, Viggo Stoltenberg-Hansen, and John V. Tucker. Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theoretical Computer Science, 284(2):207-240, 2002.

• Jens Blanck, Viggo Stoltenberg-Hansen, and John V. Tucker. Stability for effective algebras. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 3-15. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Jens Blanck. Computability on topological spaces by effective domain representations. PhD thesis, Uppsala University, Department of Mathematics, Uppsala, Sweden, 1997.

• Jens Blanck. Domain representability of metric spaces. Annals of Pure and Applied Logic, 83:225-247, 1997.

• Jens Blanck. Effective domain representations of H(X), the space of compact subsets. Theoretical Computer Science, 219:19-48, 1999.

• Jens Blanck. Domain representations of topological spaces. Theoretical Computer Science, 247:229-255, 2000.

• Jens Blanck. Effectivity of regular spaces. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 1-15, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Jens Blanck. Exact real arithmetic systems: Results of competition. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 389-393, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Jens Blanck. Efficient exact computation of iterated maps. The Journal of Logic and Algebraic Programming, 64:41-59, 2005.

• Markus Bläser. Uniform computational complexity of the derivatives of C^ infty -functions. Theoretical Computer Science, 284(2):199-206, 2002.

• Hans Boehm and Robert Cartwright. Exact real arithmetic, formulating real numbers as functions. In D. Turner, editor, Research topics in functional programming, pages 43-64. Addison-Wesley, 1990.

• Hans-J. Boehm. The constructive reals as a Java library. The Journal of Logic and Algebraic Programming, 64:3-11, 2005.

• Paolo Boldi and Sebastiano Vigna. delta -uniform BSS machines. Journal of Complexity, 14(2):234-256, 1998.

• Paolo Boldi and Sebastiano Vigna. Equality is a jump. Theoretical Computer Science, 219:49-64, 1999.

• Claudio Bonanno, Stefano Galatolo, and Stefano Isola. Recurrence and algorithmic information. Nonlinearity, 17(3):1057-1074, 2004.

• Volker Bosserhoff. Computability of solutions of operator equations. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 179-202, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Volker Bosserhoff. Computability of solutions of operator equations. Mathematical Logic Quarterly, 53(4-5):326-344, 2007.

• Volker Bosserhoff. Are unbounded linear operators computable on the average for Gaussian measures? Journal of Complexity, 24(4):477-491, 2008.

• Volker Bosserhoff. Are unbounded linear operators computable on the average for Gaussian measures? Journal of Complexity, 24(4):477-491, 2008.

• Volker Bosserhoff. The bit-complexity of finding nearly optimal quadrature rules for weighted integration. Journal of Universal Computer Science, 14(6):938-955, 2008.

• Volker Bosserhoff. Notions of probabilistic computability on represented spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 137-170. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Volker Bosserhoff. Notions of probabilistic computability on represented spaces. Journal of Universal Computer Science, 14(6):956-995, 2008.

• Volker Bosserhoff. On the effective existence of Schauder bases (extended abstract). In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 17-21. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Olivier Bournez and Emmanuel Hainry. Elementarily computable functions over the real numbers and r-sub-recursive functions. Theoretical Computer Science, 348:130-147, 2005.

• Olivier Bournez and Emmanuel Hainry. Recursive analysis characterized as a class of real recursive functions. Fundamenta Mathematicae, 74(4):409-433, 2006.

• Olivier Bournez, Manuel L. Campagnolo, Daniel Graça, and Emmanuel S. Hainry. Polynomial differential equations compute all real computable functions on computable compact intervals. Journal of Complexity, 23(3):317-335, 2007.

• S.S. Brady and J.B. Remmel. The undecidability of the lattice of r.e. closed subsets of an effective topological space. Annals of Pure and Applied Logic, 35:193-203, 1987.

• Vasco Brattka and Ruth Dillhage. Computability of the spectrum of self-adjoint operators. Journal of Universal Computer Science, 11(12):1884-1900, 2005.

• Vasco Brattka and Ruth Dillhage. On computable compact operators on Banach spaces. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 365-386, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Vasco Brattka and Ruth Dillhage. On computable compact operators on computable Banach spaces with bases. Mathematical Logic Quarterly, 53(4-5):345-364, 2007.

• Vasco Brattka and Guido Gherardi. Borel complexity of topological operations on computable metric spaces. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 83-97, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Vasco Brattka and Guido Gherardi. Borel complexity of topological operations on computable metric spaces. Journal of Logic and Computation, 19(1):45-76, 2009.

• Vasco Brattka and Peter Hertling. Continuity and computability of relations. Informatik Berichte 164, FernUniversität Hagen, Hagen, September 1994.

• Vasco Brattka and Peter Hertling. Feasible real random access machines. Journal of Complexity, 14(4):490-526, 1998.

• Vasco Brattka and Peter Hertling. Topological properties of real number representations. Theoretical Computer Science, 284(2):241-257, 2002.

• Vasco Brattka and Iraj Kalantari. A bibliography of recursive analysis and recursive topology. In Yu. L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel, editors, Handbook of Recursive Mathematics, volume 138 of Studies in Logic and the Foundations of Mathematics, pages 583-620. Elsevier, Amsterdam, 1998. Volume 1, Recursive Model Theory.

• Vasco Brattka and Gero Presser. Computability on subsets of metric spaces. Theoretical Computer Science, 305:43-76, 2003.

• Vasco Brattka and Matthias Schröder. Computing with sequences, weak topologies and the axiom of choice. In Luke Ong, editor, Computer science logic, volume 3634 of Lecture Notes in Computer Science, pages 462-476. Springer, 2005.

• Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65-93, 1999.

• Vasco Brattka and Atsushi Yoshikawa. Towards computability of elliptic boundary value problems in variational formulation. Journal of Complexity, 22(6):858-880, 2006.

• Vasco Brattka and Martin Ziegler. Computability of linear equations. In Ricardo Baeza-Yates, Ugo Montanari, and Nicola Santoro, editors, Foundations of Information Technology in the Era of Network and Mobile Computing, volume 223 of IFIP International Federation for Information Processing, pages 95-106, Dordrecht, 2002. Kluwer Academic Publishers. 2nd IFIP International Conference on Theoretical Computer Science, Montréal, Canada, August 25-30, 2002.

• Vasco Brattka, Peter Hertling, Mariko Yasugi, and Ning Zhong, editors. Selected Papers of the Dagstuhl Seminar on Computability and Complexity in Analysis 2001, volume 48 (Suppl. 1) of Mathematical Logic Quarterly, Weinheim, 2002. Wiley-VCH.

• Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors. Computability and Complexity in Analysis, volume 66(1) of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong. Computability and complexity in analysis. Informatik Berichte 302, FernUniversität in Hagen, Hagen, August 2003. Proccedings, International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Vasco Brattka, Peter Hertling, Ker-I Ko, and Ning Zhong, editors. Special Issue Computability and Complexity in Analysis, volume 50 of Mathematical Logic Quarterly, Weinheim, 2004. Wiley-VCH. Selected Papers of the International Conference CCA 2003, held in Cincinnati, Ohio, August 28-30, 2003.

• Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors. Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Vasco Brattka, Peter Hertling, Ker-I Ko, and Hideki Tsuiki, editors. Computability and Complexity in Analysis, volume 522 of Journal of Complexity, Amsterdam, 2006. Elsevier. Selected Papers of the International Conference CCA 2005, held in Kyoto, Japan, August 25-29, 2005.

• Vasco Brattka, Christiane Frougny, and Norbert Müller, editors. Real Numbers, volume 41 of Theoretical Informatics and Applications, Les Ulis, 2007. EDP Sciences. Selected Papers of the 6th conference on Real Numbers and Computers, Dagstuhl, Germany, November 15-17, 2004.

• Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors. Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2008. Elsevier. CCA 2008, Hagen, Germany, August 21-24, 2008.

• Vasco Brattka, Peter Hertling, and Klaus Weihrauch. A tutorial on computable analysis. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, New Computational Paradigms: Changing Conceptions of What is Computable, pages 425-491. Springer, New York, 2008.

• Vasco Brattka, Hajime Ishihara, Matthias Schröder, and Ning Zhong, editors. Computability and Complexity in Analysis, volume 14 of Journal of Universal Computer Science, Graz, 2008. Graz University of Technology. Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy.

• Vasco Brattka, Hajime Ishihara, Matthias Schröder, and Ning Zhong, editors. Computability and Complexity in Analysis, volume 54 of Mathematical Logic Quarterly, Weinheim, 2008. Wiley-VCH. Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy.

• Vasco Brattka. Computable selection in analysis. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 125-138. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Vasco Brattka. Recursive characterization of computable real-valued functions and relations. Theoretical Computer Science, 162:45-77, 1996.

• Vasco Brattka. Order-free recursion on the real numbers. Mathematical Logic Quarterly, 43:216-234, 1997.

• Vasco Brattka. Recursive and Computable Operations over Topological Structures. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1998.

• Vasco Brattka. Computable invariance. Theoretical Computer Science, 210:3-20, 1999.

• Vasco Brattka. A stability theorem for recursive analysis. In Cristian S. Calude and Michael J. Dinneen, editors, Combinatorics, Computation & Logic, Discrete Mathematics and Theoretical Computer Science, pages 144-158, Singapore, 1999. Springer. Proceedings of DMTCS'99 and CATS'99, Auckland, New Zealand, January 1999.

• Vasco Brattka. Realistic models of computability on the real numbers. In Atsushi Yoshikawa, editor, Relevance and Feasibility of Mathematical Analysis on the Computer, volume 1169 of Surikaisekikenkyusho Kokyuroku, pages 62-75, Kyoto, 2000. Research Institute for Mathematical Sciences.

• Vasco Brattka. Computability of Banach space principles. Informatik Berichte 286, FernUniversität Hagen, Fachbereich Informatik, Hagen, June 2001.

• Vasco Brattka. Computable versions of Baire's category theorem. In Jirí Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, volume 2136 of Lecture Notes in Computer Science, pages 224-235, Berlin, 2001. Springer. 26th International Symposium, MFCS 2001, Mariánské Lázne, Czech Republic, August 27-31, 2001.

• Vasco Brattka. Computing uniform bounds. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Vasco Brattka. Random numbers and an incomplete immune recursive set. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 950-961, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.

• Vasco Brattka. Some notes on Fine computability. Journal of Universal Computer Science, 8(3):382-395, 2002.

• Vasco Brattka. Computability on asymmetric spaces. Informatik Berichte 305, FernUniversität in Hagen, Fachbereich Informatik, Hagen, December 2003.

• Vasco Brattka. Computability over topological structures. In S. Barry Cooper and Sergey S. Goncharov, editors, Computability and Models, pages 93-136. Kluwer Academic Publishers, New York, 2003.

• Vasco Brattka. Effective representations of the space of linear bounded operators. Applied General Topology, 4(1):115-131, 2003.

• Vasco Brattka. The emperor's new recursiveness: The epigraph of the exponential function in two models of computability. In Masami Ito and Teruo Imaoka, editors, Words, Languages & Combinatorics III, pages 63-72, Singapore, 2003. World Scientific Publishing. ICWLC 2000, Kyoto, Japan, March 14-18, 2000.

• Vasco Brattka. The inversion problem for computable linear operators. In Helmut Alt and Michel Habib, editors, STACS 2003, volume 2607 of Lecture Notes in Computer Science, pages 391-402, Berlin, 2003. Springer. 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27-March 1, 2003.

• Vasco Brattka. Plottable real number functions and the computable graph theorem. Informatik Berichte 300, FernUniversität in Hagen, Fachbereich Informatik, Hagen, July 2003.

• Vasco Brattka. Recursive quasi-metric spaces. Theoretical Computer Science, 305:17-42, 2003.

• Vasco Brattka. 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 Éric Charpentier, Annick Lesne, and Nikolai Nikolski, editors, L'héritage de Kolmogorov en mathématiques, pages 241-268. Éditions Belin, Paris, 2004.

• Vasco Brattka. Computability on non-separable Banach spaces and Landau's theorem. In Laura Crosilla and Peter Schuster, editors, From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics, pages 316-333. Oxford University Press, 2005.

• Vasco Brattka. Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly, 51(1):19-44, 2005.

• Vasco Brattka. On the Borel complexity of Hahn-Banach extensions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 3-16, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Vasco Brattka. Computable versions of the uniform boundedness theorem. In Z. Chatzidakis, P. Koepke, and W. Pohlers, editors, Logic Colloquium 2002, volume 27 of Lecture Notes in Logic, pages 130-151, Urbana, 2006. Association for Symbolic Logic.

• Vasco Brattka. From Hilbert's 13th Problem to the theory of neural networks: constructive aspects of Kolmogorov's Superposition Theorem. In Éric Charpentier, Annick Lesne, and Nikolai Nikolski, editors, Kolmogorov's Heritage in Mathematics, pages 253-280. Springer, Berlin, 2007.

• Vasco Brattka. Borel complexity and computability of the Hahn-Banach Theorem. Archive for Mathematical Logic, 46(7-8):547-564, 2008.

• Vasco Brattka. Plottable real number functions and the computable graph theorem. SIAM Journal on Computing, 38(1):303-328, 2008.

• Vasco Brattka. A computable version of Banach's inverse mapping theorem. Annals of Pure and Applied Logic, 157:85-96, 2009.

• Mark Braverman and Stephen Cook. Computing over the reals: Foundations for scientific computing. Notices of the AMS, 53(3):318-329, 2006.

• Mark Braverman and M. Yampolsky. Non-computable Julia sets. Journal of the American Mathematical Society, 19(3):551-578, 2006.

• Mark Braverman. Hyperbolic Julia sets are poly-time computable. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 17-30, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Mark Braverman. Parabolic Julia sets are polynomial time computable. Nonlinearity, 19(6):1383-1401, 2006.

• Josef M. Breutzmann, David W. Juedes, and Jack H. Lutz. Baire category and nowhere differentiability for feasible real functions. In Peter Eades and Tadao Takaoka, editors, Algorithms and Computation, volume 2223 of Lecture Notes in Computer Science, pages 219-230, Berlin, 2001. Springer. 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001.

• Josef M. Breutzmann, David W. Juedes, and Jack H. Lutz. Baire category and nowhere differentiability for feasible real functions. Mathematical Logic Quarterly, 50(4,5):460-472, 2004.

• Eyvind Briseid. A rate of convergence for asymptotic contractions. J. Math. Anal. Appl., 330:364-376, 2007.

• Eyvind Briseid. Some results on Kirk's asymptotic contractions. Fixed Point Theory, 8:17-27, 2007.

• Paul Brodhead and Douglas Cenzer. Effectively closed sets and enumerations. Archive for Mathematical Logic, 46(7-8):565–--582, 2008.

• Paul Brodhead, Douglas Cenzer, and Seyyed Dashti. Random closed sets. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 55-64, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Paul Brodhead, Douglas Cenzer, and Jeffrey B. Remmel. Random continuous functions. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Paul Brodhead. Enumerations of Pi ⁰₁ classes: acceptability and decidable classes. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 289-301, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Ashley Burrows and David Lester. Exact arithmetic and the Korteweg-de Vries equation. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 23-41. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Dmitry Buy. Some remarks about fixpoint theorems. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 43-52. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Benoit Cagnard and Pierre Simonnet. Automata, Borel functions and real numbers in Pisot base. Theoretical Informatics and Applications, 41(1):27-44, 2007.

• J. Caldwell and Marian Boykan Pour-El. 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 Mathematik, 21:1-19, 1975.

• Cristian S. Calude and Peter Hertling. Computable approximations of reals: An information-theoretic analysis. Fundamenta Informaticae, 33(2):105-120, 1998.

• Cristian Calude and Helmut Jürgensen. Randomness as an invariant for number representations. In H. Maurer, J. Karhumäki, and G. Rozenberg, editors, Results and Trends in Theoretical Computer Science, pages 44-66, Berlin, 1994. Springer.

• Cristian S. Calude and Ludwig Staiger. Generalisations of disjunctive sequences. Mathematical Logic Quarterly, 51(2):120-128, 2005.

• Cristian S. Calude, Peter Hertling, and Bakhadyr Khoussainov. Do the zeros of Riemann's Zeta-function form a random sequence? Bulletin of the European Association for Theoretical Computer Science, 62:199-207, 1997.

• Cristian S. Calude, Peter Hertling, Bakhadyr Khoussainov, and Yongge Wang. Recursively enumerable reals and Chaitin omega numbers. In Michel et al. Morvan, editor, STACS'98, volume 1373 of Lecture Notes in Computer Science, pages 596-606, Berlin, 1998. Springer. 15th Annual Symposium on Theoretical Aspects of Computer Science. Paris, France, February 25-27, 1998.

• C. S. Calude, R. Coles, P. H. Hertling, and B. Khoussainov. Degree theoretic aspects of computably enumerable reals. In S. B. Cooper and J. K. Truss, editors, Models and Computability, volume 259 of London Math. Society Lecture Note Series, pages 23-39, Cambridge, 1999. Cambridge University Press. Invited Papers from Logic Colloquium 1997, Leeds.

• Cristian S. Calude, Peter H. Hertling, Bakhadyr Khoussainov, and Yongge Wang. Recursively enumerable reals and Chaitin omega numbers. Theoretical Computer Science, 255:125-149, 2001.

• C.S. Calude, P. Hertling, H. Jürgensen, and K. Weihrauch. Randomness on full shift spaces. Chaos, Solitons & Fractals, 12(3):491-503, 2001.

• Cristian S. Calude. Chaitin omega numbers, Solovay machines, and Gödel incompleteness. Theoretical Computer Science, 284(2):269-277, 2002.

• Cristian S. Calude. A characterization of c.e. random reals. Theoretical Computer Science, 271:3-14, 2002.

• Manuel Lameiras Campagnolo and Cristopher Moore. Upper and lower bounds on continuous-time computation. In I. Antoniou, C.S. Calude, and M.J. Dinneen, editors, Unconventional Models of Computation, UMC2'K, Discrete Mathematics and Theoretical Computer Science, pages 135-153, London, 2001. Springer. Second International Conference, UMC 2000, Brussels, Belgium.

• Manuel L. Campagnolo and Kerry Ojakian. The methods of approximation and lifting in real computation. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 387-423, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Manuel L. Campagnolo and Kerry Ojakian. Characterizing computable analysis with differential equations. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 23-35. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Manuel L. Campagnolo and Kerry Ojakian. The elementary computable functions over the real numbers: applying two new techniques. Archive for Mathematical Logic, 46(7-8):593–--627, 2008.

• Manuel Lameiras Campagnolo, Cristopher Moore, and José Félix Costa. Iteration, inequalities, and differentiability in analog computers. Journal of Complexity, 16(4):642-660, 2001.

• Manuel Lameiras Campagnolo, Cristopher Moore, and José Félix Costa. An analog characterization of the Grzegorczyk hierarchy. Journal of Complexity, 18(4):977-1000, 2002.

• Manuel Lameiras Campagnolo. Computational Complexity of Real Valued Recursive Functions and Analog Circuits. PhD thesis, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisbon, 2001.

• Manuel Lameiras Campagnolo. The complexity of real recursive functions. In C.S. Calude, M.J. Dinneen, and F. Peper, editors, Unconventional Models of Computation, volume 2509 of Lecture Notes in Computer Science, pages 1-14, Berlin, 2002. Springer. Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002.

• Douglas Cenzer and Peter G. Hinman. Medvedev degrees of generalized r.e. separating classes. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 203-223, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Douglas Cenzer and Jeffrey B. Remmel. Index sets in computable analysis. Theoretical Computer Science, 219:111-150, 1999.

• Douglas Cenzer and Jeffrey B. Remmel. Effectively closed sets and graphs of computable real functions. Theoretical Computer Science, 284(2):279-318, 2002.

• Douglas Cenzer and Jeffrey B. Remmel. Index sets for computable real functions. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 164-182. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Douglas Cenzer and Jeffrey B. Remmel. Index sets for omega --languages. Mathematical Logic Quarterly, 49(1):22-33, 2003.

• Douglas Cenzer and Jeffrey B. Remmel. Index sets for computable differential equations. Mathematical Logic Quarterly, 50(4,5):329-344, 2004.

• Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors. Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Douglas Cenzer, S. Ali Dashti, and Jonathan L.F. King. Computable symbolic dynamics. Mathematical Logic Quarterly, 54(5):460-469, 2008.

• Douglas Cenzer, S. Ali Dashti, and Jonathan L.F. King. Effective symbolic dynamics. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 89-99. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Douglas Cenzer, Geoffrey Laforte, and Guohua Wu. Pseudojumps and Pi ⁰₁ classes. Journal of Logic and Computation, 19(1):77-87, 2009.

• Douglas Cenzer. Effective real dynamics. In John N. Crossley, Jefferey B. Remmel, Richard A. Shore, and Moss E. Sweedler, editors, Logical Methods in Honor of Anil Nerode's Sixtieth Birthday, volume 12 of Progress in Computer Science and Applied Logic, pages 162-177, Boston, 1993. Birkhäuser.

• Thomas Chadzelek and Günter Hotz. Analytic machines. Theoretical Computer Science, 219:151-167, 1999.

• Thomas Chadzelek. Analytische Maschinen. PhD thesis, Technische Fakultät der Universität des Saarlandes, Saarbrücken, 1998.

• G.J. Chaitin. Incompleteness theorems for random reals. Adv. in Appl. Math., 8:119-146, 1987.

• Qingliang Chen, Kaile Su, and Xizhong Zheng. Primitive recursive real numbers. Mathematical Logic Quarterly, 53(4-5):365-380, 2007.

• Qingliang Chen, Kaile Su, and Xizhong Zheng. Primitive recursiveness of real numbers under different representation. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 303-324, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• A.V. Chernavskya and V.P. Leksineb. Unrecognizability of manifolds. Annals of Pure and Applied Logic, 141(3):447-455, 2006.

• Arthur Chou and Ker-I Ko. Computational complexity of two-dimensional regions. SIAM Journal on Computing, 24:923-947, 1995.

• Arthur W. Chou and Ker-I Ko. On the complexity of finding paths in a two-dimensional domain I: Shortest paths. Mathematical Logic Quarterly, 50(6):551-572, 2004.

• Arthur W. Chou and Ker-I Ko. The computational complexity of distance functions of two-dimensional domains. Theoretical Computer Science, 337:360-369, 2005.

• Arthur W. Chou and Ker-I Ko. On the complexity of finding paths in a two-dimensional domain II: Picewise straight-line paths. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 45-57, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Arthur W. Chou. Some complexity issues in complex analysis. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 91-98. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Alberto Ciaffaglione and Pietro Di Gianantonio. A co-inductive approach to real numbers. In Thierry Coquand, Peter Dybjer, Bengt Nordström, and Jan Smith, editors, Types for Proofs and Programs, volume 1956 of Lecture Notes in Computer Science, pages 114-130, Berlin, 2000. Springer. International Workshop, TYPES'99, Lökeberg, Sweden, June 12-16, 1999.

• Alberto Ciaffaglione and Pietro Di Gianantonio. A certified, corecursive implementation of exact real numbers. Theoretical Computer Science, 351(1):39-51, 2006.

• J.P. Cleave. The primitive recursive analysis of ordinary differential equations and the complexity of their solutions. Journal of Computer and Systems Sciences, 3:447-455, 1969.

• Peter Collins and Daniel Graça. Effective computability of solutions of ordinary differential equations the thousand monkeys approach. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 103-114. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• W. Collins and P. Young. Discountinuities of provably correct operators on the provably recursive real numbers. The Journal of Symbolic Logic, 48:913-920, 1983.

• W. Collins. Provably recursive real numbers. Notre Dame J. Formal Logic, 19:513-522, 1978.

• Pieter Collins. Continuity and computability on reachable sets. Theoretical Computer Science, 341:162-195, 2005.

• Pieter Collins. Effective computation for nonlinear systems. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 169-178, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Pieter Collins. Optimal semicomputable approximations to reachable and invariant sets. Theory of Computing Systems, 41(1):33-48, 2007.

• Pieter Collins. Computability and representations of the zero set. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 37-43. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Stephen A. Cook. Computability and complexity of higher type functions. In Y.N. Moschovakis, editor, Logic from computer science, volume 21 of Mathematical Sciences Research Institute Publications, pages 51-72, New York, 1992. Springer. Proceedings of the workshop held in Berkeley, California, November 13-17, 1989.

• José Félix Costa, Bruno Loff, and Jerzy Mycka. The new promise of analog computation. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 189-195, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Fredrik Dahlgren. Computability and continuity in metric partial algebras equipped with computability structures. Mathematical Logic Quarterly, 50(4,5):486-500, 2004.

• Fredrik Dahlgren. Partial continuous functions and admissible domain representations. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 94-104, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Frédéric De Jaeger, Martín Escardó, and Gabriele Santini. On the computational content of the Lawson topology. Theoretical Computer Science, 357(1-3):230-240, 2006.

• Gregorio de Miguel Casado, Juan Manuel García Chamizo, and María Teresa Signes Pont. Algebraic model of an arithmetic unit for TTE-computable normalized rational numbers. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 218-227, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Thomas Deil. Darstellungen und Berechenbarkeit reeller Zahlen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984.

• H.J. Dettki, H. Schuster, and K. Weihrauch. Type 2 recursion theory. In J. Demetrovics, G. Katona, and A. Salomaa, editors, Algebra, Combinatorics and Logic in Computer Science, Vol. 1, volume 42 of Coll. Math. Soc. János Bolyai, pages 355-361, 1986. Papers from Colloq., Sept. 12-16, 1983, Györ.

• Hans Joachim Dettki. Untersuchungen zur Darstellungsberechenbarkeit von Ordinalzahlfunktionen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1985.

• Pietro Di Gianantonio. A Functional Approach to Computability on Real Numbers. Dottorato di ricerca in informatica, Università di Pisa-Genova-Udine, Udine, June 1993.

• Pietro Di Gianantonio. Real number computation and domain theory. Information and Computation, 127:11-25, 1996.

• Pietro Di Gianantonio. An abstract data type for real numbers. Theoretical Computer Science, 221:295-326, 1999.

• Ruth Dillhage and Vasco Brattka. Computability of the metric projection onto finite-dimensional linear subspaces. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 45-60. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors. Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Ruth Dillhage. Computability of the spectrum of self-adjoint operators and the computable operational calculus. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 365-384. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Decheng Ding, Klaus Weihrauch, and Yongcheng Wu. Absolutely non-effective predicates and functions in computable analysis. In Jin-Yi Cai, S. Barry Cooper, and Hong Zhou, editors, Theory and Applications of Models of Computation, volume 4484 of Lecture Notes in Computer Science, pages 595-604, 2007.

• Rod G. Downey and Evan J. Griffiths. Schnorr randomness. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Rod Downey and Iraj Kalantari. Effective extensions of linear forms on a recursive vector space over a recursive field. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 31(3):193-200, 1985.

• Rodney G. Downey and Geoffrey L. LaForte. Presentations of computably enumerable reals. Theoretical Computer Science, 284(2):539-555, 2002.

• Rod Downey and Sebastiaan Terwijn. Computably enumerable reals and uniformly presentable ideals. Mathematical Logic Quarterly, 48(Suppl. 1):29-40, 2002.

• Rod G. Downey, Denis R. Hirschfeldt, and Geoffrey L. LaForte. Randomness and reducibility. In Jirí Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, volume 2136 of Lecture Notes in Computer Science, pages 316-327, Berlin, 2001. Springer. 26th International Symposium, MFCS 2001, Mariánské Lázne, Czech Republic, August 27-31, 2001.

• Rod G. Downey, Denis R. Hirschfeldt, André Nies, and Frank Stephan. Trivial reals. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Rod G. Downey, Denis R. Hirschfeldt, André Nies, and Frank Stephan. Trivial reals. In Rod Downey, Ding Decheng, Tung Shih Ping, Qiu Yu Hui, and Mariko Yasugi, editors, Proceedings of the 7th and 8th Asian Logic Conferences, pages 63-102, Singapore, 2003. World Scientific. 7th Conference: Hsi-Tou, Taiwan, June 6-10, 1999; 8th Conference: Chongqing, China, August 29 -- September 2, 2002.

• Rod Downey, Guohua Wu, and Xizhong Zheng. Degrees of d.c.e. reals. Mathematical Logic Quarterly, 50(4,5):345-350, 2004.

• Rod G. Downey, Evan J. Griffiths, and Geoffrey L. LaForte. On Schnorr and computable randomness, martingales, and machines. Mathematical Logic Quarterly, 50(6):613-627, 2004.

• Rodney Downey, Wolfgang Merkle, and Jan Reimann. Schnorr dimension. Mathematical Structures in Computer Science, 16(5):789-811, 2006.

• Rodney G. Downey. Presentations of reals (abstract). In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 11-12. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• D. Du and Ker-I Ko. Computational complexity of integration and differentiation of convex functions. System Sci. and Math. Sci., 2:70-79, 1989.

• D. Du and Ker-I Ko. A note on best fractions of a computable real number. Journal of Complexity, 8:216-229, 1992.

• Zilin Du, Maria Eleftheriou, José E. Moreira, and Chee Yap. Hypergeometric functions in exact geometric computation. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Anthony J. Dunlop and Marian Boykan Pour-El. The degree of unsolvability of a real number. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 16-29, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Abbas Edalat and Martín Hötzel Escardó. Integration in real PCF. Information and Computation, 160:128-166, 2001.

• Abbas Edalat and Reinhold Heckmann. A computational model for metric spaces. Theoretical Computer Science, 193:53-73, 1998.

• Abbas Edalat and Marko Krznaric. Numerical integration with exact real arithmetic. In Jirí Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 90-104, Berlin, 1999. Springer. 26th International Colloquium, ICALP'99, Prague, Czech Republic, July, 1999.

• Abbas Edalat and André Lieutier. Domain of differentiable functions. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, page 79. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Abbas Edalat and André Lieutier. Foundation of a computable solid modelling. Theoretical Computer Science, 284(2):319-345, 2002.

• Abbas Edalat and Dirk Pattinson. Initial value problems in domain theory. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 211-227. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Abbas Edalat and Dirk Pattinson. A domain-theoretic account of Picard's theorem. LMS Journal of Computation and Mathematics, 10:83-118, 2007.

• Abbas Edalat and Peter John Potts. A new representation for exact real numbers. Electronical Notes in Theoretical Computer Science, 6:14 pp., 1997. Mathematical foundations of programming semantics (Pittsburgh, PA, 1997).

• Abbas Edalat and Fabien Rico. Root finding in exact real arithmetic using linear fractional transformations. In J.-M. Chesneaux, F. Jézéquel, J.-L. Lamotte, and J. Vignes, editors, Third Real Numbers and Computers Conference, pages 27-43. Université Pierre et Marie Curie, Paris, 1998. Paris, France, April 27-29, 1998.

• Abbas Edalat and Philipp Sünderhauf. Computable Banach spaces via domain theory. Theoretical Computer Science, 219:169-184, 1999.

• Abbas Edalat and Philipp Sünderhauf. A domain-theoretic approach to computability on the real line. Theoretical Computer Science, 210:73-98, 1999.

• Abbas Edalat, Elham Kashefi, and André Lieutier. The convex hull is computable! In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 75-77. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Abbas Edalat, Ali A. Khanban, and André Lieutier. Computability in computational geometry. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 117-127, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Abbas Edalat. Domain theory and integration. Theoretical Computer Science, 151:163-193, 1995.

• Abbas Edalat. Dynamical systems, measures, and fractals via domain theory. Information and Computation, 120(1):32-48, 1995.

• Abbas Edalat. Power domains and iterated function systems. Information and Computation, 124(2):182-197, 1996.

• Abbas Edalat. Domains for computation in mathematics, physics and exact real arithmetic. Bulletin of Symbolic Logic, 3(4):401-452, 1997.

• Abbas Edalat. A continuous derivative for real-valued functions. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 248-257, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Ju. L. Ersov. Computable functionals of finite type. Algebra and Logic, 11(4):203-242, 1972.

• Henri-Alex Esblin. Rudimentary computable reals. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 21-30. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Martín H. Escardó and J. Raymundo Marcial-Romero. Semantics of a sequential language for exact real-number computation. Theoretical Computer Science, 379:120-141, 2007.

• Martín Hötzel Escardó and Thomas Streicher. Induction and recursion on the partial real line with applications to real PCF. Theoretical Computer Science, 210:121-157, 1999.

• Martín Hötzel Escardó and Thomas Streicher. In domain realizability not all functionals on c[-1,1] are continuous. Mathematical Logic Quarterly, 48(Suppl. 1):41-44, 2002.

• Martín Hötzel Escardó. PCF extended with real numbers. Theoretical Computer Science, 162:79-115, 1996.

• Martín Hötzel Escardó. 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.

• Mirko Degli Esposti and Stefano Galatolo. Recurrence near given sets and the complexity of the Casati-Prosen map. Chaos Solitons Fractals, 23(4):1275-1284, 2005.

• Gábor Etesi and István Németi. Non-Turing computations via Malament-Hogarth space-times. International Journal of Theoretical Physics, 41(2):341-370, 2002.

• Amin Farjudian. SHRAD: A language for sequential real number computation. Theory of Computing Systems, 41(1):49-105, 2007.

• Fernando Ferreira and Gilda Ferreira. Counting as integration in feasible analysis. Mathematical Logic Quarterly, 52(3):315-320, 2006.

• Fernando Ferreira and Gilda Ferreira. The Riemann integral in weak systems of analysis. Journal of Universal Computer Science, 14(6):908-937, 2008.

• Fernando Ferreira and Paulo Oliva. Bounded functional interpretation and feasible analysis. Annals of Pure and Applied Logic, 145(2):115-129, 2007.

• Santiago Figueira, Frank Stephan, and Guohua Wu. Randomness and universal machines. Journal of Complexity, 22(6):738-751, 2006.

• Willem Fouché. Arithmetical representation of Brownian motion I. The Journal of Symbolic Logic, 65:421-442, 2000.

• Willem Fouché. The descriptive complexity of Brownian motion. Advances in Mathematics, 155:317-343, 2000.

• Willem Fouché. An algorithmic construction of quantum circuits of high descriptive complexity. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 61-69. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Willem Fouché. Dynamics of a generic Brownian motion: Recursive aspects. Theoretical Computer Science, 394:175-186, 2008.

• Johanna N.Y. Franklin. Schnorr trivial reals: a construction. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 79-93, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Johanna N.Y. Franklin. Schnorr trivial reals: a construction. Archive for Mathematical Logic, 46(7-8):665–--678, 2008.

• Rudolf Freund and Ludwig Staiger. Numbers defined via Turing machines. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 119-124. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Rudolf Freund and Ludwig Staiger. Numbers defined by Turing machines. Collegium Logicum, Annals of the Kurt-Gödel-Society, 2:118-137, 1996.

• Rudolf Freund. Real functions and numbers defined by Turing machines. Theoretical Computer Science, 23:287-304, 1983.

• Harvey Friedman. On the computational complexity of maximization and integration. Advances in Mathematics, 53:80-98, 1984.

• Peter Gács. Uniform test of algorithmic randomness over a general space. Theoretical Computer Science, 341:91-137, 2005.

• Stefano Galatolo. Pointwise information entropy for metric spaces. Nonlinearity, 12:1289-1298, 1999.

• Stefano Galatolo. Orbit computability by computable structures. Nonlinearity, 13:1531-1546, 2000.

• Stefano Galatolo. Complexity, initial condition sensitivity, dimension and weak chaos in dynamical systems. Nonlinearity, 16(4):1219-1238, 2003.

• Stefano Galatolo. Global and local complexity in weakly chaotic dynamical systems. Discrete and Continuous Dynamical Systems, 9(6):1607-1624, 2003.

• Tobias Gärtner and Günter Hotz. Recursive analytic functions of a complex variable. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 81-97. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• William Gay, Bing-Yu Zhang, and Ning Zhong. Computability of solutions of the Korteweg-de Vries equation. Mathematical Logic Quarterly, 47(1):93-110, 2001.

• Xiaolin Ge and Anil Nerode. On extreme points of convex compact Turing located sets. In Anil Nerode and Yu. V. Matiyasevich, editors, Logical Foundations of Computer Science, volume 813 of Lecture Notes in Computer Science, pages 114-128, Berlin, 1994. Springer. Third International Symposium, LFCS'94, St. Petersburg, Russia, July 11-14, 1994.

• Xiaolin Ge and Anil Nerode. Effective content of the calculus of variations I: semi-continuity and the chattering lemma. Annals of Pure and Applied Logic, 78:127-146, 1996.

• Xiaolin Ge and J. Ian Richards. Computability in unitary representations of compact groups. In John N. Crossley, Jefferey B. Remmel, Richard A. Shore, and Moss E. Sweedler, editors, Logical Methods in Honor of Anil Nerode's Sixtieth Birthday, volume 12 of Progress in Computer Science and Applied Logic, pages 386-421, Boston, 1993. Birkhäuser.

• Xiaolin Ge. Some Algorithms in Euclidean Space and Group Representations. Thesis, University of Minnesota, Minneapolis, May 1993.

• Philipp Gerhardy. Applications of Proof Interpretations. PhD thesis, Department of Computer Science, University of Aarhus, Denmark, Aarhus, 2006.

• Philipp Gerhardy. A quantitative version of Kirk's fixed point theorem for asymptotic contractions. J. Math. Anal. Appl., 316:339-345, 2006.

• Herman Geuvers, Milad Niqui, Bas Spitters, and Freek Wiedijk. Constructive analysis, types and exact real numbers. Mathematical Structures in Computer Science, 17:3-36, 2007.

• Guido Gherardi and Alberto Marcone. How incomputable is the separable Hahn-Banach theorem? In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 85-102. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Guido Gherardi. An analysis of the lemmas of Urysohn and Urysohn-Tietze according to effective Borel measurability. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 199-208, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Guido Gherardi. Effective Borel degrees of some topological functions. Mathematical Logic Quarterly, 52(6):625-642, 2006.

• Guido Gherardi. Some Results in Computable Analysis and Effective Borel Measurability. PhD thesis, University of Siena, Department of Mathematics and Computer Science, Siena, 2006.

• Guido Gherardi. Internal computability. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 348-357, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• R.L. Goodstein and J. Hooley. On recursive transcendence. Notre Dame J. Formal Logic, 1:127-137, 1960.

• R.L. Goodstein. Missing value theorems. Math. Gaz., 33:19-25, 1949.

• R.L. Goodstein. Mean value theorems in recursive function theory I. Differential mean value theorems. Proc. London Math. Soc., 52:81-106, 1950.

• R.L. Goodstein. The recursive irrationality of pi . The Journal of Symbolic Logic, 19:267-274, 1954.

• R.L. Goodstein. On non-constructive theorems of analysis and the decision problem. Math. Scand., 3:261-263, 1956.

• R.L. Goodstein. Recursive analysis. In A. Heyting, editor, Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, pages 37-42, Amsterdam, 1959. North-Holland. Proc. Colloq., Amsterdam, Aug. 26-31, 1957.

• R.L. Goodstein. Recursive Analysis. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1961.

• R.L. Goodstein. Existence in mathematics. Compositio Math., 20:70-82, 1968.

• R.L. Goodstein. A constructive form for the second Gauss proof of the fundamental theorem of algebra. In Constructive Aspects of the Fundamental Theorem of Algebra, pages 69-76, NY, 1969. Willey-Interscience. Proc. Sympos. Zürich-Rüschlikon, June 5-7, 1967.

• R.L. Goodstein. Polynomials with computable coefficients. Notre Dame J. Formal Logic, 11:447-448, 1970.

• Dan Gordon and Eliahu Shamir. Computation of recursive functionals using minimal initial segments. Theoretical Computer Science, 23:305-315, 1983.

• Marco Gori and Klaus Meer. A step towards a complexity theory for analog systems. Mathematical Logic Quarterly, 48(Suppl. 1):45-58, 2002.

• Paul Gowland and David Lester. A survey of exact arithmetic implementations. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 30-47, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Daniel Silva Graça and José Félix Costa. Analog computers and recursive functions over the reals. Journal of Complexity, 19(5):644-664, 2003.

• Daniel Silva Graça, Manuel L. Campagnolo, and Jorge Buescu. Robust simulations of Turing machines with analytic maps and flows. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 169-179, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Daniel Silva Graça. Computability via analog circuits. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 229-240. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Daniel Silva Graça. Some recent developments on Shannon's general purpose analog computer. Mathematical Logic Quarterly, 50(4,5):473-485, 2004.

• Daniel S. Graça, Jorge Boescu, and Manuel L. Campagnolo. Boundedness of the domain of definition is undecidable for polynomial ODEs. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 49-57. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Tanja Grubba and Klaus Weihrauch. A computable version of Dini's theorem for topological spaces. In Pinar Yolum, Tunga Güngör, Fikret Gürgen, and Can Özturan, editors, Computer and Information Sciences - ISCIS 2005, volume 3733 of Lecture Notes in Computer Science, pages 927-936, Berlin, 2005. Springer. 20th International Symposium, ISCIS, Istanbul, Turkey, October 2005.

• Tanja Grubba and Klaus Weihrauch. On computable metrization. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 345-364, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch. Computability and complexity in analysis. Informatik Berichte 326, FernUniversität Hagen, Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Tanja Grubba, Matthias Schröder, and Klaus Weihrauch. Computable metrization. Mathematical Logic Quarterly, 53(4-5):381-395, 2007.

• Tanja Grubba, Klaus Weihrauch, and Yatao Xu. Effectivity on continuous functions in topological spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 237-254. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Andrzej Grzegorczyk. Undecidability of some topological theories. Fund. Math., 38:137-152, 1951.

• Andrzej Grzegorczyk. Computable functionals. Fundamenta Mathematicae, 42:168-202, 1955.

• Andrzej Grzegorczyk. On the definition of computable functionals. Fundamenta Mathematicae, 42:232-239, 1955.

• Andrzej Grzegorczyk. On the definitions of computable real continuous functions. Fundamenta Mathematicae, 44:61-71, 1957.

• Andrzej Grzegorczyk. Some approaches to constructive analysis. In A. Heyting, editor, Constructivity in mathematics, Studies in Logic and the Foundations of Mathematics, pages 43-61, Amsterdam, 1959. North-Holland. Colloquium at Amsterdam, 1957.

• Andrzej Grzegorczyk. Mathematical and empirical verifiability. In Twenty-five Years of logic. Methodol. in Poland, pages 165-169, 1977.

• Xiaoyang Gu, Jack H. Lutz, and Elvira Mayordomo. Points on computable curves. In 47th Annual IEEE Symposium on Foundations of Computer Science, pages 469-474. IEEE Computer Society Press, 2006. Proceedings of FOCS 2006, Berkeley, CA, October 22-24, 2006.

• Jürgen Hauck. Ein Kriterium für die Annahme des Maximums in der Berechenbaren Analysis. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 17:193-196, 1971.

• Jürgen Hauck. Zur Präzisierung des Begriffes berechenbare reelle Funktion. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 17:295-300, 1971.

• Jürgen Hauck. Berechenbare gleichmäßige Finitheit rekursiver funktionale. Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin, Math.-Nat. R. XXI(5):527-529, 1972.

• Jürgen Hauck. Berechenbare gleichmäßige Stetigkeit in der konstruktiven Analysis von Klaua. Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin, Math.-Nat. R. XXI(5):523-526, 1972.

• Jürgen Hauck. Funktional-Rekursion. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 18:31-36, 1972.

• Jürgen Hauck. Berechenbare reelle Funktionen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 19:121-140, 1973.

• Jürgen Hauck. Iterationsverfahren in der konstruktiven Analysis. Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin, Math.-Nat. R. XXIV(6):799-800, 1975.

• Jürgen Hauck. Turingmaschinen und berechenbare reelle Funktionen. Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin, Math.-Nat. R. XXIV(6):797-798, 1975.

• Jürgen Hauck. Berechenbare reelle Funktionenfolgen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22:265-282, 1976.

• Jürgen Hauck. Rekursive Funktionale und der Fixpunksatz von Banach. Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin, Math.-Nat. R. XXVI(5):635-636, 1977.

• Jürgen Hauck. Zum Zwischenwertsatz in der konstruktiven Analysis. Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin, Math.-Nat. R. XXVI(5):623-627, 1977.

• Jürgen Hauck. Konstruktive Darstellungen reeller Zahlen und Folgen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24:365-374, 1978.

• Jürgen Hauck. Konstruktive Darstellungen in topologischen Räumen mit rekursiver Basis. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 26:565-576, 1980.

• Jürgen Hauck. Stetigkeitseigenschaften berechenbarer reeller Funktionen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 26:69-76, 1980.

• Jürgen Hauck. Berechenbarkeit in topologischen Räumen mit rekursiver Basis. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 27:473-480, 1981.

• Jürgen Hauck. Stetigkeitseigenschaften berechenbarer Funktionale. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 28:377-383, 1982.

• Jürgen Hauck. Konstruktive reelle Funktionale und Operatoren. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 29:213-218, 1983.

• Jürgen Hauck. Eine neue Definition berechenbarer reeller Funktionen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 30:259-268, 1984.

• Jürgen Hauck. Zur Wellengleichung mit konstruktiven Randbedingungen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 30:561-566, 1984.

• Jürgen Hauck. Ein Kriterium für die konstruktive Lösbarkeit der Differentialgleichung y'=f(x,y). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 31:357-362, 1985.

• Jürgen Hauck. Eine berechenbare Funktion mit rationalen Werten, die nicht rekursiv ist. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 33:255-256, 1987.

• Susumu Hayashi. Mathematics based on incremental learning-excluded middle and inductive inference. Theoretical Computer Science, 350:125-139, 2006.

• Reinhold Heckmann. Contractivity of linear fractional transformations. Theoretical Computer Science, 279:65-82, 2002.

• Gerhard Heindl, Vladik Kreinovich, and Maria Rifqi. In case of interval (or more general) uncertainty, no algorithm can choose the simplest representative. Reliable Computing, 8:213-227, 2002.

• Armin Hemmerling. On the time complexity of partial real functions. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 31-40. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Armin Hemmerling. On approximative and algebraic computability over the real numbers. Theoretical Computer Science, 219:185-223, 1999.

• Armin Hemmerling. Berechenbarkeit über den reellen Zahlen, der approximative und der algebraische Zugang. In Jürgen Flachsmeyer, Rudolph Fritsch, and Hans-Christian Reichel, editors, Mathematik-interdisziplinär, pages 167-176, Aachen, 2000. Shaker Verlag.

• Armin Hemmerling. On the time complexity of partial real functions. Journal of Complexity, 16:363-376, 2000.

• Armin Hemmerling. Standard representations of effective metric spaces. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 48-68, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Armin Hemmerling. Effective metric spaces and representations of the reals. Theoretical Computer Science, 284(2):347-372, 2002.

• Armin Hemmerling. Approximate decidability in Euclidean spaces. Mathematical Logic Quarterly, 49(1):34-56, 2003.

• Armin Hemmerling. Characterizations of the class delta ₂^ta over Euclidean spaces. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 241-254. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Armin Hemmerling. The discrete parts of approximately decidable sets in Euclidean spaces. Mathematical Logic Quarterly, 49(4):428-432, 2003.

• Armin Hemmerling. Characterizations of the class Delta ₂^ta over Euclidean spaces. Mathematical Logic Quarterly, 50(4,5):507-519, 2004.

• Armin Hemmerling. Hierarchies of function classes defined by the first-value operator (extended abstract). In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 59-72, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Armin Hemmerling. The Hausdorff-Ershov hierarchy in Euclidean spaces. Archive for Mathematical Logic, 45:323-350, 2006.

• Armin Hemmerling. Hierarchies of function classes defined by the first-value operator. Theoretical Informatics and Applications, 42(2):253-270, 2008.

• Peter Hertling and Klaus Weihrauch. Levels of degeneracy and exact lower complexity bounds for geometric algorithms. In Proceedings of the Sixth Canadian Conference on Computational Geometry, pages 237-242. University of Saskatchewan, 1994. Saskatoon, Saskatchewan, August 2-6, 1994.

• Peter Hertling and Klaus Weihrauch. On the topological classification of degeneracies. Informatik Berichte 154, FernUniversität Hagen, Hagen, February 1994.

• Peter Hertling and Klaus Weihrauch. Randomness spaces. In Kim G. Larsen, Sven Skyum, and Glynn Winskel, editors, Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 796-807, Berlin, 1998. Springer. 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 1998.

• Peter Hertling and Klaus Weihrauch. Random elements in effective topological spaces with measure. Information and Computation, 181(1):32-56, 2003.

• Peter Hertling. Stetige Reduzierbarkeit auf Sigma ^ omega von Funktionen mit zweielementigem Bild und von zweistetigen Funktionen mit diskretem Bild. Informatik Berichte 153, FernUniversität Hagen, Hagen, December 1993.

• Peter Hertling. Topologische Komplexitätsgrade von Funktionen mit endlichem Bild. Informatik Berichte 152, FernUniversität Hagen, Hagen, December 1993.

• Peter Hertling. Disjunctive omega -words and real numbers. Informatik Berichte 180, FernUniversität Hagen, Hagen, May 1995.

• Peter Hertling. Disjunctive omega-words und real numbers. Journal of Universal Computer Science, 2(7):549-568, 1996.

• Peter Hertling. Topological complexity with continuous operations. Journal of Complexity, 12:315-338, 1996.

• Peter Hertling. Unstetigkeitsgrade von Funktionen in der effektiven Analysis. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1996.

• Peter Hertling. Effectivity and effective continuity of functions between computable metric spaces. In Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten, editors, Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, pages 264-275, Singapore, 1997. Springer. Proceedings of DMTCS'96.

• Peter Hertling. The real number structure is effectively categorical. CDMTCS Research Report Series 057, University of Auckland, Auckland, September 1997.

• Peter Hertling. Surjective functions on computably growing Cantor sets. Journal of Universal Computer Science, 3(11):1226-1240, 1997.

• Peter Hertling. An effective Riemann Mapping Theorem. Theoretical Computer Science, 219:225-265, 1999.

• Peter Hertling. A real number structure that is effectively categorical. Mathematical Logic Quarterly, 45(2):147-182, 1999.

• Peter Hertling. Standard representations of real numbers. Chaos, Solitons & Fractals, 10(6):1087-1101, 1999.

• Peter Hertling. Banach-Mazur computable functions on metric spaces. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 69-81, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Peter Hertling. Random sets versus random sequences. Informatik Berichte 288, FernUniversität Hagen, Hagen, September 2001.

• Peter Hertling. A Banach-Mazur computable but not Markov computable function on the computable real numbers. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 962-972, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.

• Peter Hertling. A comparison of certain representations of regularly closed sets. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Peter Hertling. Topological complexity of zero finding with algebraic operations. Journal of Complexity, 18(4):912-942, 2002.

• Peter Hertling. Topological complexity of zero finding for continuous functions (abstract). In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, page 13. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Peter Hertling. A Banach-Mazur computable but not Markov computable function on the computable real numbers. Annals of Pure and Applied Logic, 132(2-3):227-246, 2005.

• Peter Hertling. Is the Mandelbrot set computable? Mathematical Logic Quarterly, 51(1):5-18, 2005.

• Peter Hertling. A sequentially computable function that is not effectively continuous at any point. Journal of Complexity, 22(6):752-767, 2006.

• Eiju Hirowatari and Setsuo Arikawa. A comparison of identification criteria for inductive inference of recursive real-valued functions. Theoretical Computer Science, 268:351-366, 2001.

• John M. Hitchcock and Jack H. Lutz. Why computational complexity requires stricter martingales. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 549-560, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.

• John M. Hitchcock. Correspondence principles for effective dimensions. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 561-572, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.

• Chun-Kuen Ho. Beyond recursive real functions. Technical Report 1994-06, University of Chicago, Department of Computer Science, 1994.

• Chun-Kuen Ho. Relatively recursive reals and real functions. Technical Report 1994-02, University of Chicago, Department of Computer Science, 1994.

• Chun-Kuen Ho. Beyond recursive real functions. Information and Computation, 124(2):113-126, 1996.

• Chun-Kuen Ho. Relatively recursive reals and real functions. Theoretical Computer Science, 210(1):99-120, 1999.

• Mark L. Hogarth. Predictability, Computability, and Spacetime. Phd thesis, University of Cambridge, UK, 2000.

• H. James Hoover. Feasible Constructive Analysis. Ph.d. dissertation, Dept. of Computer Science, University of Toronto, Toronto, Canada, 1987.

• H. James Hoover. Why integration is hard. In Erich Kaltofen and Stephen M. Watt, editors, Computers and mathematics, pages 172-181. Springer, 1989. Conference held at the Massachusetts Institute of Technology, Cambridge, Massachusetts, June 13-17, 1989.

• H. James Hoover. Feasible real functions and arithmetic circuits. SIAM Journal on Computing, 19(1):182-204, 1990.

• H. James Hoover. Real functions, contraction mappings, and P-completeness. Information and Computation, 93(2):333-349, 1991.

• H. James Hoover. Computational models for feasible real analysis. In Samuel R. Buss and Philip J. Scott, editors, Feasible mathematics, volume 9 of Progress in Computer Science and Applied Logic, pages 221-237. Birkhäuser, 1993. Proceedings of the workshop held at Cornell University, Ithaca, New York, June 26-28, 1989.

• Tie Hou. Coinductive proofs for basic real computation. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 221-230, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Mathieu Hoyrup, Arda Kolçak, and Giuseppe Longo. Computability and the morphological complexity of some dynamics on continuous domains. Theoretical Computer Science, 398:170-182, 2008.

• L. Hudes. Hyperarithmetical real numbers and hyperarithmetical analysis. Ph.d. dissertation, Massachusetts Institute of Technology, Cambridge, Mass., 1962.

• Jesse Hughes and Milad Niqui. Admissible digit sets. Theoretical Computer Science, 351(1):61-73, 2006.

• Namhyun Hur and James H. Davenport. A generic root operation for exact real arithmetic. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 82-87, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Shinji Iizuka. Effective continuities on effective topological spaces. Journal of Complexity, 22(6):894-908, 2006.

• Dieter Ilse. Zur Stetigkeit berechenbarer reeller Funktionen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 11:297-342, 1965.

• Wei Jiang, Yuan Wang, and Jeffery Zucker. Universality and semicomputability for nondeterministic programming languages over abstract algebras. The Journal of Logic and Algebraic Programming, 71(1):44-78, 2007.

• I. Kalantari and A. Leggett. Simplicity in effective topology. The Journal of Symbolic Logic, 47:169-183, 1982.

• I. Kalantari and A. Leggett. Maximality in effective topology. The Journal of Symbolic Logic, 48:100-112, 1983.

• I. Kalantari and J.B. Remmel. Degrees of recursively enumerable topological spaces. The Journal of Symbolic Logic, 48:610-622, 1983.

• I. Kalantari and A. Retzlaff. Recursive constructions in topological spaces. The Journal of Symbolic Logic, 44:609-625, 1979.

• I. Kalantari and G. Weitkamp. Effective topological spaces, I. A definability theory. Annals of Pure and Applied Logic, 29:1-27, 1985.

• I. Kalantari and G. Weitkamp. Effective topological spaces, II. A hierarchy. Annals of Pure and Applied Logic, 29:207-224, 1985.

• I. Kalantari and G. Weitkamp. Effective topological spaces, III. forcing and definability. Annals of Pure and Applied Logic, 36:17-27, 1985.

• Iraj Kalantari and Lawrence Welch. Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I. Annals of Pure and Applied Logic, 93(1-3):125-151, 1998.

• Iraj Kalantari and Lawrence Welch. Recursive and nonextendible functions over the reals; filter foundation for recursive analysis, II. Annals of Pure and Applied Logic, 98(1-3):87-110, 1999.

• Iraj Kalantari and Lawrence Welch. Recursive quantum functions, avoidable points, & shadow points in recursive analysis. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Iraj Kalantari and Larry Welch. A blend of methods of recursion theory and topology. Annals of Pure and Applied Logic, 124(1-3):141-178, 2003.

• Iraj Kalantari and Larry Welch. Density and Baire category in recursive topology. Mathematical Logic Quarterly, 50(4,5):381-391, 2004.

• Iraj Kalantari and Larry Welch. On degree-preserving homeomorphisms between trees in computable topology. Archive for Mathematical Logic, 46(7-8):679–--693, 2008.

• Iraj Kalantari and Larry Welch. On Turing degrees of points in computable topology. Mathematical Logic Quarterly, 54(5):470-482, 2008.

• Iraj Kalantari. Major subsets in effective topology. In G. Metakides, editor, Patras Logic Symposion, Studies in Logic and the Foundations of Mathematics, pages 77-94, Amsterdam, 1982. North-Holland. Proc. Logic Sympos. Patras, Greece, Aug. 18-22, 1980.

• Iraj Kalantari. Density & Baire category in recursive topology. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 15-18. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Hiroyasu Kamo and Kiko Kawamura. Computability of self-similar sets. Mathematical Logic Quarterly, 45:23-30, 1999.

• Hiroyasu Kamo, Kiko Kawamura, and Izumi Takeuti. Hausdorff dimension and computational complexity. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 41-50. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Hiroyasu Kamo, Kiko Kawamura, and Izumi Takeuti. Computational complexity of fractal sets. Real Analysis Exchange, 26(2):773-793, 2000/01.

• Hiroyasu Kamo. Effective contraction theorem and its application. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 88-100, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Hiroyasu Kamo. Computability and computable uniqueness of Urysohn's universal metric space. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 149-159. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Hiroyasu Kamo. Effective Dini's theorem on effectively compact metric spaces. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 73-82, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• George Kapoulas. Computable p-adic numbers. CDMTCS Research Report Series 115, University of Auckland, Auckland, November 1999.

• George Kapoulas. Polynomially time computable functions over p-adic fields. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 101-118, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Bruce M. Kapron. Feasibly continuous type-two functionals. Computational Complexity, 8(2):188-201, 1999.

• Elham Kashefi. Quantum domain theory -- definitions and applications. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 255-274. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Akitoshi Kawamura. Type-2 computability and Moore's recursive functions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 83-95, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Tom Kelsey. Exact numerical computation via symbolic computation. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 187-197. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Robert Kenny. Orbit complexity and entropy for group endomorphisms. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 97-110, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Mohamed Khalouani, Salah Labhalla, and Henri Lombardi. Etude constructive de problemes de topologie pour les reels irrationnels. Mathematical Logic Quarterly, 45(2):257-288, 1999.

• Ali Asghar Khanban, Abbas Edalat, and André Lieutier. Computability of Delaunay triangulation and Voronoi diagram. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Tien D. Kieu. Mathematical computability questions for some classes of linear and non-linear differential equations originated from Hilbert's tenth problem. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 161-168. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Bjørn Kjos-Hanssen, André Nies, and Frank Stephan. On a question of Ambos-Spies and Kucera. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 275-278. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Dieter Klaua. Berechenbare Analysis. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 2:265-303, 1956.

• Dieter Klaua. Die Präzisierung des Berechenbarkeitsbegriffes in der Analysis mit Hilfe rationaler Funktionale. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 5:33-96, 1959.

• Dieter Klaua. Berechenbare Reihen. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6:143-161, 1960.

• Dieter Klaua. Konstruktive Analysis. Deutscher Verlag der Wissenschaften, Berlin, 1961.

• Dieter Klaua. Rational and real ordinal numbers. In Real Numbers, Generalizations of the Reals, and Theories of Continua, volume 242 of Synthese Lib., pages 259-276, 1994.

• Ker-I Ko and H. Friedman. Computational complexity of real functions. Theoretical Computer Science, 20:323-352, 1982.

• Ker-I Ko and H. Friedman. Computing power series in polynomial time. Advances in Applied Math., 9:40-50, 1988.

• Ker-I Ko and Klaus Weihrauch. Computability and complexity in analysis. Informatik Berichte 190, FernUniversität Hagen, Hagen, September 1995. Proceedings of the CCA Workshop, Hagen, August 19-20, 1995.

• Ker-I Ko and Klaus Weihrauch. On the measure of two-dimensional regions with polynomial-time computable boundaries. In Steve Homer and Jin-Yi Cai, editors, Eleventh Annual IEEE Conference on Computational Complexity, pages 150-159, Los Alamitos, 1996. IEEE Computer Society Press.

• Ker-I Ko and Fuxiang Yu. Jordan curves with polynomial inverse moduli of continuity. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 425-447, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Ker-I Ko and Fuxiang Yu. Jordan curves with polynomial inverse moduli of continuity. Theoretical Computer Science, 381(1-3):148-161, 2007.

• Ker-I Ko and Fuxiang Yu. On the complexity of computing the logarithm and square root functions on a complex domain. Journal of Complexity, 23(1):2-24, 2007.

• Ker-I Ko and Fuxiang Yu. On the complexity of convex hulls of subsets of the two-dimensional plane. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 121-135. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Ker-I Ko, Norbert Müller, and Klaus Weihrauch. Computability and complexity in analysis. Forschungsbericht Mathematik/Informatik 96-44, Universität Trier, Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

• Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann. Computability and complexity in analysis. Informatik Berichte 235, FernUniversität Hagen, Hagen, August 1998. Proceedings of the CCA Workshop, Brno, Czech Republic, August, 1998.

• Ker-I Ko, Anil Nerode, and Klaus Weihrauch, editors. Computability and Complexity in Analysis, volume 284(2) of Theoretical Computer Science, Amsterdam, 2002. Elsevier.

• Ker-I Ko. The maximum value problem and NP real numbers. Journal of Computer and Systems Sciences, 24:15-35, 1982.

• Ker-I Ko. Some negative results on the computational complexity of total variation and differentiation. Inform. Contr., 53:21-31, 1982.

• Ker-I Ko. On the computational complexity of ordinary differential equations. Inform. Contr., 58:157-194, 1983.

• Ker-I Ko. On the definitions of some complexity classes of real numbers. Math. Systems Theory, 16:95-109, 1983.

• Ker-I Ko. Reducibilities on real numbers. Theoretical Computer Science, 31:101-123, 1984.

• Ker-I Ko. Continuous optimization problems and a polynomial hierarchy of real functions. Journal of Complexity, 1:210-231, 1985. (Special issue: Complexity of Approximating Solved Problems, Papers from Sympos. Columbia Univ., Morningside Heights, NY, Apr. 17-19, 1985).

• Ker-I Ko. Approximation to measurable functions and its relation to probabilistic computation. Annals of Pure and Applied Logic, 30:173-200, 1986.

• Ker-I Ko. On the computational complexity of best Chebyshev approximations. Journal of Complexity, 2:95-120, 1986.

• Ker-I Ko. On the continued fraction representation of computable real numbers. Theoretical Computer Science, 47:299-313, 1986. corr. ibid., Vol. 54 (1987), Pages 341-343.

• Ker-I Ko. Inverting a one-to-one real function is inherently sequential. In S. Buss and P.J. Scott, editors, Feasible Mathematics, volume 9, pages 239-257, 1990. (Proc. Workshop, June 16-18, 1989, Cornell Univ. Ithaca, NY).

• Ker-I Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991.

• Ker-I Ko. On the computational complexity of integral equations. Annals of Pure and Applied Logic, 58:201-228, 1992.

• Ker-I Ko. Computational complexity of fixed points and intersection points. Journal of Complexity, 11:265-292, 1995.

• Ker-I Ko. A polynomial-time computable curve whose interior has a nonrecursive measure. Theoretical Computer Science, 145:241-270, 1995.

• Ker-I Ko. Recent progress on complexity theory of real functions. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 83-90. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Ker-I Ko. Fractals and complexity. In Ker-I Ko, Norbert Müller, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, pages 43-48. Universität Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

• Ker-I Ko. On the computability of fractal dimensions and Hausdorff measure. Annals of Pure and Applied Logic, 93:195-216, 1998.

• Ker-I Ko. Polynomial-time computability in analysis. In Yu. L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel, editors, Handbook of Recursive Mathematics, volume 139 of Studies in Logic and the Foundations of Mathematics, pages 1271-1317, Amsterdam, 1998. Elsevier. Volume 2, Recursive Algebra, Analysis and Combinatorics.

• Ker-I Ko. Computational complexity of fractals. In Rod Downey, Ding Decheng, Tung Shih Ping, Qiu Yu Hui, and Mariko Yasugi, editors, Proceedings of the 7th and 8th Asian Logic Conferences, pages 252-269, Singapore, 2003. World Scientific. 7th Conference: Hsi-Tou, Taiwan, June 6-10, 1999; 8th Conference: Chongqing, China, August 29 -- September 2, 2002.

• Petter K. Kober. Uniform domain representations of ell _p--spaces. Mathematical Logic Quarterly, 180(2):180-205, 2007.

• Ulrich Kohlenbach and Branimir Lambov. Bounds on iterations of asymptotically quasi-nonexpansive mappings. In J.G. Falset, E.L. Fuster, and B. Sims, editors, Proceedings of the International Conference on Fixed Point Theory and Applications, pages 143-172. Yokohama Publishers, 2004. Valencia 2003.

• Ulrich Kohlenbach and Laurentiu Leustean. Mann iterates of directionally nonexpansive mappings in hyperbolic spaces. Abstract and Applied Analysis, 2003(8):449-477, 2003.

• Ulrich Kohlenbach and Laurentiu Leustean. The approximate fixed point property in product spaces. Nonlinear Analysis, 66:806-818, 2007.

• Ulrich Kohlenbach and Paulo Oliva. Proof mining in l₁-approximation. Annals of Pure and Applied Logic, 121:1-38, 2003.

• Ulrich Kohlenbach. Effective moduli from ineffective uniqueness proofs. an unwinding of de La Vallé Poussin's proof for Chebycheff approximation. Annals of Pure and Applied Logic, 64:27-94, 1993.

• Ulrich Kohlenbach. 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:581-606, 1993.

• Ulrich Kohlenbach. Analysing proofs in analysis. In Wilfried Hodges, Martin Hyland, Charles Steinhorn, and John Truss, editors, Logic: from Foundations to Applications, pages 225-260, Oxford, 1996. Clarendon Press. European Logic Colloquium.

• Ulrich Kohlenbach. Arithmetizing proofs in analysis. In J.M. Larrazabal, D. Lascar, and G. Mints, editors, Logic Colloquium '96, volume 12 of Lecture Notes in Logic, pages 115-158, Berlin, 1997. Springer. Proceedings of the Colloquium held in Sebastián, Spain, July 9-15, 1996.

• Ulrich Kohlenbach. Proof theory and computational analysis. Electronic Notes in Theoretical Computer Science, 13:1-34, 1998.

• Ulrich Kohlenbach. The use of a logical principle of uniform boundedness in analysis. In A. Cantini, E. Casari, and P. Minari, editors, Logic and Foundations of Mathematics, volume 280 of Synthese Library, pages 93-106. Kluwer Academic Publishers, 1999.

• Ulrich Kohlenbach. Things that can and things that cannot be done in PRA. Annals of Pure and Applied Logic, 102:223-245, 2000.

• Ulrich Kohlenbach. On the computational content of the Krasnoselski and Ishikawa fixed point theorems. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 119-145, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Ulrich Kohlenbach. A quantitative version of a theorem due to Borwein-Reich-Shafrir. Numerical Functional Analysis and Optimization, 22(5):641-656, 2001.

• Ulrich Kohlenbach. On uniform weak König's lemma. Annals of Pure and Applied Logic, 114:103-116, 2002.

• Ulrich Kohlenbach. On weak Markov's principle. Mathematical Logic Quarterly, 48(Suppl. 1):59-65, 2002.

• Ulrich Kohlenbach. Uniform asymptotic regularity for Mann iterates. Journal of Mathematical Analysis and Applications, 279:531-544, 2003.

• Ulrich Kohlenbach. Higher order reverse mathematics. In Stephen G. Simpson, editor, Reverse Mathematics 2001, volume 21 of Lecture Notes in Logic, pages 281-295, Wellesley, 2005. A K Peters.

• Ulrich Kohlenbach. Some computational aspects of metric fixed point theory. Nonlinear Analysis, 61:823-837, 2005.

• Ulrich Kohlenbach. Some logical metatheorems with applications in functional analysis. Trans. Amer. Math. Soc., 357:89-128, 2005.

• Ulrich Kohlenbach. A logical uniform boundedness principle for abstract metric and hyperbolic spaces. In Grigori Mints and Ruy de Queiroz, editors, Logic, Language, Information and Computation, volume 165 of Electronic Notes in Theoretical Computer Science, pages 81-93, Amsterdam, 2006. Elsevier. WoLLIC 2006, 13th Workshop on Logic, Language, Information and Computation, Stanford University, CA, USA, 18-21 July 2006.

• Ulrich Kohlenbach. Proof interpretations and the computational content of proofs in mathematics. Bulletin of the EATCS, 93:143-173, 2007.

• Ulrich Kohlenbach. Effective bounds from proofs in abstract functional analysis. In Barry Cooper, Benedikt Loewe, and Andrea Sorbi, editors, New Computational Paradigms: Changing Conceptions of What is Computable, pages 223-258. Springer, 2008.

• Pascal Koiran and Christopher Moore. Closed-form analytic maps in one and two dimensions can simulate universal Turing machines. Theoretical Computer Science, 219:217-223, 1999.

• Michal Konecny. Many-Valued Real Functions Computable by Finite Transducers using IFS-Representations. PhD thesis, School of Computer Science, University of Birmingham, Birmingham, 2000.

• Michal Konecny. Real functions computable by finite automata using affine representations. Theoretical Computer Science, 284(2):373-396, 2002.

• Michal Konecny. Real functions incrementally computable by finite automata. Theoretical Computer Science, 315:109-133, 2004.

• M.V. Korovina and O.V. Kudinov. Majorant-computability and definability over the reals. In J.-M. Chesneaux, F. Jézéquel, J.-L. Lamotte, and J. Vignes, editors, Third Real Numbers and Computers Conference, pages 61-80. Université Pierre et Marie Curie, Paris, 1998. Paris, France, April 27-29, 1998.

• M.V. Korovina and O.V. Kudinov. A new approach to computability over the reals. Siberian Advances in Mathematics, 8(3):59-73, 1998.

• M.V. Korovina and O.V. Kudinov. Characteristic properties of majorant-computability over the reals. In Georg Gottlob, Etienne Grandjean, and Katrin Seyr, editors, Computer Science Logic, volume 1584 of Lecture Notes in Computer Science, pages 188-203, Berlin, 1999. Springer. Proceedings of the 12th International Workshop (CSL '98) (7th Annual Conference of the European Association for Computer Science Logic (EACSL)) held in Brno, August 24-28, 1998.

• M.V. Korovina and O.V. Kudinov. Some properties of majorant-computability. In Marat M. Arslanov and Steffen Lempp, editors, Recursion Theory and Complexity, volume 2 of Logic and Its Applications, pages 97-114, Berlin, 1999. de Gruyter. Proceedings of the Kazan Workshop, Kazan, Russia, July 14-19, 1997.

• Margarita V. Korovina and Oleg V. Kudinov. Formalisation of computability of operators and real-valued functionals via domain theory. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 146-168, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Margarita V. Korovina and Oleg V. Kudinov. Semantic characterisations of second-order computability over the real numbers. In Laurent Fribourg, editor, Computer Science Logic, volume 2142 of Lecture Notes in Computer Science, pages 160-172, Berlin, 2001. Springer. 15th International Workshop, CSL 2001, 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001.

• Margarita Korovina and Oleg Kudinov. Towards computability of higher type continuous data. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 235-241, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Margarita Korovina and Oleg Kudinov. The uniformity principle for Sigma -definability with applications to computable analysis. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 416-425, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Margarita Korovina and Oleg Kudinov. Towards computability over effectively enumerable topological spaces. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 115-125. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Margarita Korovina and Oleg Kudinov. The uniformity principle for Sigma -definability. Journal of Logic and Computation, 19(1):159-174, 2009.

• M.V. Korovina. Generalized computability of real functions. Siberian Advances in Mathematics, 2(4):85-103, 1992.

• Margarita V. Korovina. Fixed points on the real numbers without the equality test. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Vladik Kreinovich and Luc Longpré. Fast quantum algorithms for handling probabilistic and interval uncertainty. Mathematical Logic Quarterly, 50(4,5):405-416, 2004.

• Georg Kreisel and Daniel Lacombe. Ensembles récursivement mesurables et ensembles récursivement ouverts et fermés. Comptes Rendus Académie des Sciences Paris, 245:1106-1109, 1957.

• G. Kreisel, D. Lacombe, and J.R. Shoenfield. Fonctionnelles récursivement définissables et fonctionnelles récursives. C.R. Acad. Sci. Paris, 245:399-402, 1957.

• G. Kreisel, D. Lacombe, and J.R. Shoenfield. Partial recursive functionals and effective operations. In A. Heyting, editor, Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, pages 290-297, Amsterdam, 1959. North-Holland. Proc. Colloq., Amsterdam, Aug. 26-31, 1957.

• G. Kreisel. 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 Logic, 47:900-902, 1982.

• Christoph Kreitz and Klaus Weihrauch. Complexity theory on real numbers and functions. In A.B. Cremers and H.P. Kriegel, editors, Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science. Springer, 1982. 6th GI-Conference, Dortmund, January 5-7, 1983.

• Christoph Kreitz and Klaus Weihrauch. Towards a thoery of representations. In G. Wechsung, editor, Frege Conference 1984, pages 73-79, Berlin, 1984. Akademie-Verlag. Proceedings of the International Conference held at Schwerin, September 10-14, 1984.

• Christoph Kreitz and Klaus Weihrauch. A unified approach to constructive and recursive analysis. In M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, and W. Thomas, editors, Computation and Proof Theory, volume 1104 of Lecture Notes in Mathematics, pages 259-278, Berlin, 1984. Springer. Proceedings of the Logic Colloquium, Aachen, July 18-23, 1983, Part II.

• Christoph Kreitz and Klaus Weihrauch. Theory of representations. Theoretical Computer Science, 38:35-53, 1985.

• Christoph Kreitz and Klaus Weihrauch. Compactness in constructive analysis revisited. Annals of Pure and Applied Logic, 36:29-38, 1987.

• Christoph Kreitz. Theorie der Darstellungen und ihre Anwendungen in der konstruktiven Analysis. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984.

• Vladimir N. Krupski. Effective simultaneous approximability of reals. Theoretical Computer Science, 284(2):397-417, 2002.

• Marko Krznaric. Computing a required absolute precision from a stream of linear fractional transformations. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 169-186, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Martin Kummer and Marcus Schäfer. Computability of convex sets. In Ernst W. Mayr and Claude Puech, editors, STACS'95, volume 900 of Lecture Notes in Computer Science, pages 550-561, Berlin, 1995. Springer. 12th Annual STACS, Munich.

• Daren Kunkle and Matthias Schröder. Some examples of non-metrizable spaces allowing a simple type-2 complexity theory. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 111-123, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Daren Kunkle. Computability on spaces of integrable functions. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 279-301. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Daren Kunkle. Defining type-2 computability structures on analytical spaces. Informatik Berichte 314, FernUniversität in Hagen, Fachbereich Informatik, Hagen, April 2004.

• Daren Kunkle. Type-2 computability on spaces of integrable functions. Mathematical Logic Quarterly, 50(4,5):417-430, 2004.

• Boris Abramovich Kusner. Effective meaning of a theorem on uniform limit transition (Russian). In N.M. Nagornyi, editor, Problems in Mathematical Logic and in the Theory of Algorithms, pages 3-10. Akad. Nauk SSSR, Vycisl. Centr., 1988.

• Boris Abramovich Kusner. Markov's constructive mathematical analysis: the expectations and the results. In P.P. Petkov, editor, Mathematical Logic, pages 53-58. Plenum, 1990. (Proc. Heyting '88 Summer School, Chaika, Sept. 13-23, 1988).

• Boris Abramovich Kusner. Markov's constructive analysis; a participant's view. Theoretical Computer Science, 219:267-285, 1999.

• Salah Labhalla and Henri Lombardi. Comparaison des complexites des nombres reels dans differentes representations (a la cauchy, a la dedekind, par fractions continues). Comptes Rendus Académie des Sciences Paris, 310:483-488, 1990.

• Salah Labhalla and Henri Lombardi. Comparaison des differentes representations des nombres reels du point de vue des fonctionnelles recursives. Comptes Rendus Académie des Sciences Paris, 311:229-234, 1990.

• Salah Labhalla and Henri Lombardi. Real numbers, continued fractions, and complexity classes. Annals of Pure and Applied Logic, 50:1-28, 1990.

• Salah Labhalla and Henri Lombardi. Complexite du calcul du developpement d'un nombre reel en fractions continues. Theoretical Computer Science, 83:219-235, 1991.

• Salah Labhalla and Henri Lombardi. Analyse de complexité pour un théorème de Hall sur les fractions continues. Mathematical Logic Quarterly, 42:134-144, 1996.

• S. Labhalla, H. Lombardi, and E. Moutai. 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 Science, 250:265-332, 2001.

• A.H. Lachlan. Recursive real numbers. The Journal of Symbolic Logic, 28:1-16, 1963.

• Daniel Lacombe. Classes récursivement fermés et fonctions majorantes. Comptes Rendus Académie des Sciences Paris, 240:716-718, June 1955. Théorie des fonctions.

• Daniel Lacombe. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I. Comptes Rendus Académie des Sciences Paris, 240:2478-2480, June 1955. Théorie des fonctions.

• Daniel Lacombe. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles II. Comptes Rendus Académie des Sciences Paris, 241:13-14, July 1955. Théorie des fonctions.

• Daniel Lacombe. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles III. Comptes Rendus Académie des Sciences Paris, 241:151-153, July 1955. Théorie des fonctions.

• Daniel Lacombe. Remarques sur les opérateurs récursifs et sur les fonctions récursives d'une variable réelle. Comptes Rendus Académie des Sciences Paris, 241:1250-1252, November 1955. Théorie des fonctions.

• Daniel Lacombe. Les ensembles récursivement ouverts ou fermés, et leurs applications à l'Analyse récursive. Comptes Rendus Académie des Sciences Paris, 245:1040-1043, 1957. Logique.

• Daniel Lacombe. Quelques propriétés d'analyse récursive. Comptes Rendus Académie des Sciences Paris, 244:838-840,996-997, 1957.

• Daniel Lacombe. Les ensembles récursivement ouverts ou fermés, et leurs applications à l'Analyse récursive. Comptes Rendus Académie des Sciences Paris, 246:28-31, 1958. Logique.

• Daniel Lacombe. 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, pages 67-75, Paris, 1958. Editions du Centre National de la Recherche Scientifique. Colloques Internationaux du Centre National de la Recherche Scientifique, LXX.

• Daniel Lacombe. Quelques procédés de définition en topologie récursive. In A. Heyting, editor, Constructivity in mathematics, pages 129-158, Amsterdam, 1959. North-Holland. Colloquium at Amsterdam, 1957.

• Branimir Lambov. A two-layer approach to the computability and complexity of real functions. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 303-324. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Branimir Lambov. Rates of convergence of recursively defined sequences. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 125-133, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Branimir Lambov. RealLib: an efficient implementation of exact real arithmetic. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 169-175. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Branimir Lambov. Topics in the Theory and Practice of Computable Analysis. PhD thesis, Department of Computer Science, University of Aarhus, Denmark, Aarhus, 2005.

• Branimir Lambov. The basic feasible functionals in computable analysis. Journal of Complexity, 22(6):909-917, 2006.

• Branimir Lambov. RealLib: An efficient implementation of exact real arithmetic. Mathematical Structures in Computer Science, 17:81-98, 2007.

• Simon Langley and Daniel Richardson. What can we do with a solution? In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Jimmie D. Lawson and Bin Lu. Riemann and Edalat integration on domains. Theoretical Computer Science, 305:259-275, 2003.

• Stéphane Le Roux and Martin Ziegler. Singular coverings and non-uniform notions of closed set computability. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 73-88. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Stéphane Le Roux and Martin Ziegler. Singular coverings and non-uniform notions of closed set computability. Mathematical Logic Quarterly, 54(5):545-560, 2008.

• R.S. Lehman. On primitive recursive real numbers. Fundamenta Mathematicae, 49:105-118, 1961.

• David Lester, Scott Chambers, and Heoi Lee Lu. A constructive algorithm for finding the exact roots of polynomials with computable real coefficients. Theoretical Computer Science, 279:51-64, 2002.

• Laurentiu Leustean. Proof mining in R-trees and hyperbolic spaces. In Grigori Mints and Ruy de Queiroz, editors, Logic, Language, Information and Computation, volume 165 of Electronic Notes in Theoretical Computer Science, pages 95-106, Amsterdam, 2006. Elsevier. WoLLIC 2006, 13th Workshop on Logic, Language, Information and Computation, Stanford University, CA, USA, 18-21 July 2006.

• Laurentiu Leustean. A quadratic rate of asymptotic regularity for CAT(0)-spaces. J. Math. Anal. Appl., 2007:386-399, 325.

• Andrew E.M. Lewis and George Barmpalias. Random reals and Lipschitz continuity. Mathematical Structures in Computer Science, 16(5):737-749, 2006.

• A.A. Lewis. Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games. Math. Social Sciences, 24:209-235, 1992.

• C. Li, S. Pion, and C.K. Yap. Recent progress in exact geometric computation. The Journal of Logic and Algebraic Programming, 64:85-111, 2005.

• Peter Lietz. From Constructive Mathematics to Computable Analysis via the Realizability Interpretation. PhD thesis, Fachbereich Mathematik, TU Darmstadt, Darmstadt, 2004.

• Andrè Lieutier. Toward a data type for solid modeling based on domain theory. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 51-60. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Leonid Lisovik and Olha Shkaravska. On fractal dimension of sets defined by transducers. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 261-270. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Dianchen Lu and Qingyan Wang. Computing the solution of the m-Korteweg-de Vries equation on Turing machines. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 219-236. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for the dual of C[0;1]. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 157-177, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for the dual of C[0;1]. Mathematical Logic Quarterly, 53(4-5):415-430, 2007.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for locally compact Hausdorff spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 3-12. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for locally compact Hausdorff spaces. Journal of Universal Computer Science, 14(6):845-860, 2008.

• Robert S. Lubarsky. On the Cauchy completeness of the constructive Cauchy reals. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 225-254, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Robert S. Lubarsky. On the Cauchy completeness of the constructive Cauchy reals. Mathematical Logic Quarterly, 53(4-5):396-414, 2007.

• Jack Lutz and Klaus Weihrauch. Connectivity properties of dimension level sets. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 295-304. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Jack H. Lutz and Klaus Weihrauch. Connectivity properties of dimension level sets. Mathematical Logic Quarterly, 54(5):483-491, 2008.

• Jack H. Lutz. Effective fractal dimensions. Mathematical Logic Quarterly, 51(1):62-72, 2005.

• J. Raymundo Marcial-Romero and M. Andrew Moshier. Sequential real number computation and recursive relations. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 171-189. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• J. Raymundo Marcial-Romero and M. Andrew Moshier. Sequential real number computation and recursive relations. Mathematical Logic Quarterly, 54(5):492-507, 2008.

• Keye Martin. Complexity and verification of a renee equation. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 271-286. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Alec Matheson and Timothy H. McNicholl. Computable analysis and Blaschke products. Proceedings of the American Mathematical Society, 136:321-332, 2008.

• Stanislaw Mazur. Computable Analysis, volume 33. Razprawy Matematyczne, Warsaw, 1963.

• Timothy H. McNicholl. Computability and the implicit function theorem. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 3-15, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Timothy H. McNicholl. Uniformly computable aspects of inner functions. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 27-36. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Timothy H. McNicholl. Uniformly computable aspects of inner functions: estimation and factorization. Mathematical Logic Quarterly, 54(5):508-518, 2008.

• Timothy H. McNicholl. A uniformly computable implicit function theorem. Mathematical Logic Quarterly, 54(3):272-279, 2008.

• Valérie Ménissier-Morain. Arbitrary precision real arithmetic: design and algorithms. The Journal of Logic and Algebraic Programming, 64:13-39, 2005.

• Herbert Meschkowski. Rekursive reelle Zahlen. Math. Z., 66:189-202, 1956.

• George Metakides and Anil Nerode. The introduction of non-recursive methods into mathematics. In A.S. Troelstra and D. van Dalen, editors, The L.E.J. Brouwer Centenary Symposium, volume 110 of Studies in Logic and the foundations of mathematics, pages 319-335, Amsterdam, 1982. North-Holland. Proceedings of the conference held in Noordwijkerhout, June 8-13, 1981.

• George Metakides, Anil Nerode, and R.A. Shore. Recursive limits on the Hahn-Banach theorem. In Murray Rosenblatt, editor, Errett Bishop: Reflections on Him and His Research, volume 39 of Contemporary Mathematics, pages 85-91, Providence, 1985. American Mathematical Society. Proceedings of the memorial meeting for Errett Bishop, University of California, San Diego, September 24, 1983.

• Charles Meyssonnier, Paolo Boldi, and Sebastiano Vigna. delta -approximable functions. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 187-199, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Jöran Mielke. Refined bounds on Kolmogorov complexity for omega -languages. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 181-189. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Webb Miller. Recursive function theory and numerical analysis. Journal of Computer and Systems Sciences, 4:465-472, 1970.

• Joseph S. Miller. Effectiveness for embedded spheres and balls. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Joseph Stephen Miller. Pi-0-1 Classes in Computable Analysis and Topology. PhD thesis, Cornell University, Ithaca, USA, 2002.

• Joseph S. Miller. Degrees of unsolvability of continuous functions. The Journal of Symbolic Logic, 69(2):555-584, 2004.

• Shoki Miyamoto and Atsushi Yoshikawa. Computable sequences in the Sobolev spaces. Proc. Japan Acad. Ser. A, 80(3):15-17, 2004.

• Takakazu Mori, Yoshiki Tsujii, and Mariko Yasugi. Computability structures on metric spaces. In Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten, editors, Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, pages 351-362, Singapore, 1997. Springer. Proceedings of DMTCS'96.

• Takakazu Mori, Yoshiki Tsujii, and Mariko Yasugi. Fine computable functions and effective Fine convergence. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 177-197. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Takakazu Mori, Mariko Yasugi, and Yoshiki Tsujii. Effective Fine-convergence of Walsh-Fourier series. Mathematical Logic Quarterly, 54(5):519-534, 2008.

• Takakazu Mori, Mariko Yasugi, and Yoshiki Tsujii. Integral of Fine computable functions and Walsh Fourier series. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 279-293. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Takakazu Mori, Mariko Yasugi, and Yoshiki Tsujii. Integral of two-dimensional Fine-computable functions. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 141-152. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Takakazu Mori. Computabilities of fine-continuous functions. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 200-221, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Takakazu Mori. On the computability of Walsh functions. Theoretical Computer Science, 284(2):419-436, 2002.

• Andrei Morozov and Margarita Korovina. Remarks on sigma -definability without the equality test over the reals. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 315-322. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Andrei S. Morozov and Margarita V. Korovina. On Sigma -definability without equality over the real numbers. Mathematical Logic Quarterly, 54(5):535-544, 2008.

• Yiannis Nicholas Moschovakis. Notation systems and recursive ordered fields. Compositio Math., 17:40-71, 1964.

• Yiannis Nicholas Moschovakis. Recursive metric spaces. Fundamenta Mathematicae, 55:215-238, 1964.

• Philippe Moser. On the convergence of Fourier series of computable Lebesgue integrable functions. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 13-18. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Andrzej Mostowski. A lemma concerning recursive functions and its applications. Bull. Acad. Polon. Sci. Cl. III, 1:277-280, 1953.

• Andrzej Mostowski. The present state of investigations on the foundations of mathematics, volume 9 of Rozprawy Matematyczne. Polska Akademia Nauk, Warsaw, 1955.

• Andrzej Mostowski. On computable sequences. Fundamenta Mathematicae, 44:37-51, 1957.

• Andrzej Mostowski. On various degrees of constructivism. In A. Heyting, editor, Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, pages 178-194, Amsterdam, 1959. North-Holland. Proc. Colloq., Amsterdam, Aug. 26-31, 1957.

• Norbert Th. Müller and B. Moiske. Solving initial value problems in polynomial time. In Proceedings of the 22th JAIIO - Panel'93, Part 2, pages 283-293, 1993. Buenos Aires, 1993.

• Norbert Th. Müller and Xishun Zhao. Jordan areas and grids. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 191-206. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Norbert Th. Müller. Computational complexity of real functions and real numbers. Informatik Berichte 59, FernUniversität Hagen, Hagen, June 1986.

• Norbert Th. Müller. Subpolynomial complexity classes of real functions and real numbers. In Laurent Kott, editor, Proceedings of the 13th International Colloquium on Automata, Languages, and Programming, volume 226 of Lecture Notes in Computer Science, pages 284-293, Berlin, 1986. Springer.

• Norbert Th. Müller. Uniform computational complexity of Taylor series. In Thomas Ottmann, editor, Proceedings of the 14th International Colloquium on Automata, Languages, and Programming, volume 267 of Lecture Notes in Computer Science, pages 435-444, Berlin, 1987. Springer.

• Norbert Th. Müller. Untersuchungen zur Komplexität reeller Funktionen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1988.

• Norbert Th. Müller. Polynomial time computation of Taylor series. In Proceedings of the 22th JAIIO - Panel'93, Part 2, pages 259-281, 1993. Buenos Aires, 1993.

• Norbert Th. Müller. Constructive aspects of analytic functions. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 105-114. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Norbert Th. Müller. Towards a real Real RAM: a prototype using C++. In Ker-I Ko, Norbert Müller, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, pages 59-66. Universität Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

• Norbert Th. Müller. Implementing limits in an interactive RealRAM. In J.-M. Chesneaux, F. Jézéquel, J.-L. Lamotte, and J. Vignes, editors, Third Real Numbers and Computers Conference, pages 59-66. Université Pierre et Marie Curie, Paris, 1998. Paris, France, April 27-29, 1998.

• Norbert Th. Müller. Computability on random variables. Theoretical Computer Science, 219:287-299, 1999.

• Norbert Th. Müller. The iRRAM: Exact arithmetic in C++. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 222-252, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Norbert Th. Müller. Real numbers and BDDs. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Bharat C. Mulupuru, Vladik Kreinovich, and Roberto Osegueda. Interval approach to phase measurements can lead to arbitrarily complex sets - a theorem and ways around it. Numerical Algorithms, 37:285-299, 2004.

• Jerzy Mycka and José Félix Costa. Real recursive functions and their hierarchy. Journal of Complexity, 20(6):835-857, 2004.

• Jerzy Mycka and José Félix Costa. The computational power of continuous dynamic systems. In Maurice Margenstern, editor, Machines, Computations, Universality, volume 3354 of Lecture Notes in Computer Science, pages 163-174, Berlin, 2005. Springer. Conference on Machines, Computations, Universality, MCU 2004, Saint-Petersburg, Russia, September 21-26, 2004.

• Jerzy Mycka and José Félix Costa. The P not =NP conjecture in the context of real and complex analysis. Journal of Complexity, 22(2):287-303, 2006.

• Jerzy Mycka and José Félix Costa. A new conceptual framework for analog computation. Theoretical Computer Science, 374:277-290, 2007.

• Jerzy Mycka. Infinite limits and R-recursive functions. Acta Cybernetica, 16(1):83-91, 2003.

• Jerzy Mycka. mu--recursion and infinite limits. Theoretical Computer Science, 302:123-133, 2003.

• Jerzy Mycka. Two hierarchies of R--recursive functions. Annales UMCS Informatica Lublin-Polonia AI, 1:49-59, 2003.

• Jerzy Mycka. Real recursive functions and Baire classes. Fundamenta Informaticae, 65(3):263-278, 2005.

• J. Myhill and J. Shepherdson. Effective operations on partial recursive functions. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1:310-317, 1955.

• John Myhill. Criteria of constructibility for real numbers. The Journal of Symbolic Logic, 18(1):7-10, 1953.

• John Myhill. A recursive function defined on a compact interval and having a continuous derivative that is not recursive. Michigan Math. J., 18:97-98, 1971.

• John Myhill. What is a real number? The American Mathematical Monthly, 79:748-754, 1972.

• Wayne C. Myrvold. Computability in quantum mechanics. In Werner DePauli-Schimanovich, Eckehart Köhler, and Friedrich Stadler, editors, The foundational debate, volume 3 of Vienna Circle Institute Yearbook, pages 33-46, Dordrecht, 1995. Kluwer. Conference on the Foundational Debate: Constructivity and Complexity in Logic, Mathematics and Physics held at the University of Vienna, Vienna, September 1994.

• Wayne C. Myrvold. The decision problem for entanglement. In Robert S. Cohen, Michael Horne, and John Stachel, editors, Potentiality, Entanglement and Passion-at-a-Distance, volume 194 of Boston Studies in the Philosophy of Science, pages 177-190, Dordrecht, 1997. Kluwer. Symposium on Foundations of Quantum Mechanics held at Boston University, Boston, MA, September 19, 1994.

• Masahiro Nakata and Susumu Hayashi. A limiting first order realizability interpretation. Sci. Math. Jpn., 55(3):567-580, 2002.

• Satyadev Nandakumar. Characterization of constructive dimension. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 323-337. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Nedialko S. Nedialkov, Vladik Kreinovich, and Scott A. Starks. Interval arithmetic, affine arithmetic, taylor series methods: Why, what next? Numerical Algorithms, 37:325-336, 2004.

• István Németi and Dávid Gyula. Relativistic computers and the Turing barrier. Applied Mathematics and Computation, 178(1):118-142, 2006.

• Anil Nerode and Wen-Qi Huang. Application of pure recursion theory in recursive analysis. Acta Mathematica Sinica, 28:625-636, 1985. (in Chinese).

• Anil Nerode, Ker-I Ko, and Klaus Weihrauch, editors. Computability and Complexity in Analysis, volume 219, Amsterdam, 1999. Elsevier. Special issue of Theoretical Computer Science.

• Keng Meng Ng, Frank Stephan, and Guohua Wu. Degrees of weakly computable reals. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 413-422, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Milad Niqui. Formalizing Exact Arithmetic -- Representations, Algorithms and Proofs. PhD thesis, Institute for Programming Research and Algorithmics, University of Nijmegen, Nijmegen, 2004.

• Milad Niqui. Formalising exact arithmetic in type theory. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 368-377, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Milad Niqui. Productivity of Edalat-Potts exact arithmetic in constructive type theory. Theory of Computing Systems, 41(1):127-154, 2007.

• Elena Ju. Nogina. Effectively topological spaces. Dokl. Akad. Nauk SSSR, 169:28-31, 1966.

• Elena Ju. Nogina. Correlations between certain classes of effectively topological spaces. Mat. Zametki, 5:483-495, 1969.

• Elena Ju. Nogina. Enumerable topological spaces (Russian). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24(2):141-176, 1978.

• Elena Ju. Nogina. The relation between separability and traceability of sets (Russian). In Mathematical logic and mathematical linguistics, pages 135-144. Kalinin. Gos. Univ., Klinin, 1981.

• Dag Normann. Exact real number computations relative to hereditarily total functionals. Theoretical Computer Science, 284(2):437-453, 2002.

• Dag Normann. Hierarchies of total functionals over the reals. Theoretical Computer Science, 316:137-151, 2004.

• Russel O'Connor. A monadic, functional implementation of real numbers. Mathematical Structures in Computer Science, 17:129-159, 2007.

• Paulo Oliva. On the computational complexity of best l₁-approximation. Mathematical Logic Quarterly, 48(Suppl. 1):66-77, 2002.

• Paulo Oliva. Proof Mining in Subsystems of Analysis. PhD thesis, Department of Computer Science, University of Aarhus, Denmark, Aarhus, 2003.

• W.R. de Oliveira and M.B. Smyth. Quasimetric Sigma -algebras. In SEMISH'94, pages 547-561. Sociedade Brasileira de Computação, 1994. XXI Seminario Integrado de Software e Hardware, Minas Gerais, Brazil.

• Matthew W. Parker. Undecidability in Rⁿ: Riddled basins, the KAM tori, and the stability of the solar system. Philosophy of Science, 70:359-382, 2003.

• Matthew W. Parker. Three concepts of decidability for general subsets of uncountable spaces. Theoretical Computer Science, 351(1):2-13, 2006.

• Dirk Pattinson. Domain-theoretic formulation of linear boundary value problems. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 385-395, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Peter Peshev and Dimiter Skordev. A subrecursive refinement of the fundamental theorem of algebra. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 435-444, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Rózsa Péter. Recursive Functions. Academic Press, New York, 3rd edition, 1967.

• Jan von Plato. Order in open intervals of computable reals. Mathematical Structures in Computer Science, 9:103-108, 1999.

• Petrus H. Potgieter. Zeno machines and hypercomputation. Theoretical Computer Science, 358(1):23-33, 2006.

• Marian Pour-El and J. Caldwell. On a simple definition of computable functions of a real variable. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:1-19, 1975.

• Marian Boykan Pour-El and J. Ian Richards. Differentiability properties of computable functions - a summary. Acta Cybernetica, 4:123-125, 1978.

• Marian Boykan Pour-El and J. Ian Richards. A computable ordinary differential equation which possesses no computable solution. Annals Math. Logic, 17:61-90, 1979.

• Marian Boykan Pour-El and J. Ian Richards. The wave equation with computable inital data such that its unique solution is not computable. Advances in Math., 39:215-239, 1981.

• Marian Boykan Pour-El and J. Ian Richards. Computability and noncomputability in classical analysis. Trans. Amer. Math. Soc., 275:539-560, 1983.

• Marian Boykan Pour-El and J. Ian Richards. Noncomputability in analysis and physics: a complete determination of the class of noncomputable linear operators. Advances in Math., 48:44-74, 1983.

• Marian Boykan Pour-El and J. Ian Richards. L^p-computability in recursive analysis. Proceedings of the American Mathematical Society, 92:93-97, 1984.

• Marian Boykan Pour-El and J. Ian Richards. Three theorems on the computability of linear operators, their eigenvalues and eigenvectors. Surikaisekikenkyusho Kokyuroku, 588:149-161, 1986. Logic and the foundations of mathematics (Japanese).

• Marian Boykan Pour-El and J. Ian Richards. The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not. Advances in Math., 63:1-41, 1987.

• Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.

• Marian Pour-El and Ning Zhong. The wave equation with computable initial data whose unique solution is nowhere computable. Mathematical Logic Quarterly, 43(4):499-509, 1997.

• Marian Pour-El and Ning Zhong. Boundary regularity and computability. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 325-343. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Marian Boykan Pour-El. 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:1-28, 1974.

• Marian Boykan Pour-El. Church's thesis and recursive analysis. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 115-118. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Marian Boykan Pour-El. Some open problems in computable analysis. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, page 61. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Marian Boykan Pour-El. From axiomatics to intrinsic characterization: some open problems in computable analysis. Theoretical Computer Science, 219:319-329, 1999.

• Marian Boykan Pour-El. The structure of computability in analysis and physical theory: An extension of Church's thesis. In Edward R. Griffor, editor, Handbook of Computability Theory, volume 140 of Studies in Logic and the Foundations of Mathematics, pages 449-471, Amsterdam, 1999. Elsevier.

• Alexander Raichev. Relative randomness and real closed fields. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 135-143, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Robert Rettinger and Klaus Weihrauch. The computational complexity of some Julia sets. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Robert Rettinger and Klaus Weihrauch. The computational complexity of some Julia sets. In Michel X. Goemans, editor, Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 177-185, New York, 2003. ACM Press. San Diego, California, USA, June 9-11, 2003.

• Robert Rettinger and Xizhong Zheng. Hierarchy of monotonically computable real numbers. In Jirí Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, volume 2136 of Lecture Notes in Computer Science, pages 633-644, Berlin, 2001. Springer. 26th International Symposium, MFCS 2001, Mariánské Lázne, Czech Republic, August 27-31, 2001.

• Robert Rettinger and Xizhong Zheng. On the hierarchy and extension of monotonically computable real numbers. Journal of Complexity, 19:672-691, 2003.

• Robert Rettinger and Xizhong Zheng. On the Turing degrees of divergence bounded computable reals. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 418-428, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Robert Rettinger and Xizhong Zheng. Solovay reducibility on d-c.e. real numbers. In Lusheng Wang, editor, Computing and Combinatorics, volume 3595 of Lecture Notes in Computer Science, pages 359-368, Berlin, 2005. Springer. 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005.

• Robert Rettinger and Xizhong Zheng. A hierarchy of Turing degrees of divergence bounded computable real numbers. Journal of Complexity, 22(6):818-826, 2006.

• Robert Rettinger, Xizhong Zheng, Romain Gengler, and Burchard von Braunmühl. Monotonically computable real numbers. In C.S. Calude, M.J. Dinneen, and S. Sburlan, editors, Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, pages 187-201, London, 2001. Springer. Proceedings of DMTCS 2001.

• Robert Rettinger, Xizhong Zheng, Romain Gengler, and Burchard von Braunmühl. Weakly computable real numbers and total computable real functions. In Jie Wang, editor, Computing and Combinatorics, volume 2108 of Lecture Notes in Computer Science, pages 586-595, Berlin, 2001. Springer. 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001.

• Robert Rettinger, Xizhong Zheng, Romain Gengler, and Burchard von Braunmühl. Monotonically computable real numbers. Mathematical Logic Quarterly, 48(3):459-479, 2002.

• Robert Rettinger, Xizhong Zheng, and Burchard von Braunmühl. Computable real functions of bounded variation and semi-computable real numbers. In Oscar H. Ibarra and Louxin Zhang, editors, Computing and Combinatorics, volume 2387 of Lecture Notes in Computer Science, pages 47-56, Berlin, 2002. Springer. COCOON 2002, 8th Annual International Conference, August 15-17, 2002, Singapore.

• Robert Rettinger, Klaus Weihrauch, and Ning Zhong. Complexity of blowup problems – extended abstract –. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 219-230. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Robert Rettinger. A fast algorithm for Julia sets of hyperbolic rational functions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 145-157, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Robert Rettinger. Computable Riemann surfaces. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 638-647, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Robert Rettinger. Bloch's constant is computable. Journal of Universal Computer Science, 14(6):896-895, 2008.

• Robert Rettinger. Lower bounds on the continuation of holomorphic functions. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 207-217. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Robert Rettinger. On the computability of Blochs constant. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 315-322. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• H. Rice. Recursive real numbers. Proc. Amer. Math. Soc., 5:784-791, 1954.

• D.B. Richardson. Some undecidable problems involving elementary functions of a real variable. The Journal of Symbolic Logic, 33:514-520, 1968.

• Daniel Richardson. The uniformity conjecture. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 253-272, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Marcel K. Richter and Kam-Chau Wong. Computable economic analysis. In Ker-I Ko, Norbert Müller, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, pages 81-90. Universität Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

• Marcel K. Richter and Kam-Chau Wong. Computable preference and utility. Journal of Mathematical Economics, 32(3):339-354, 1999.

• Marcel K. Richter and Kam-Chau Wong. Non-computability of competitive equilibrium. Economic Theory, 14(1):1-27, 1999.

• R.M. Robinson. Review of ``Peter, R., Rekursive Funktionen''. The Journal of Symbolic Logic, 16:280-282, 1951.

• N.A. Sanin. Constructive Real Numbers and Constructive Function Spaces, volume 21 of Translations of Mathematical Monographs. American Mathematical Society, Providence, 1968.

• Giesela Schäfer and Klaus Weihrauch. Admissible representations of effective cpo-s. Informatik Berichte 16, FernUniversität Hagen, Hagen, April 1981.

• Claus Peter Schnorr. Komplexität von Algorithmen mit Anwendung auf die Analysis. Archiv für Mathematische Logik und Grundlagenforschung, 14:54-68, 1971.

• Matthias Schröder and Alex Simpson. Representing probability measures using probabilistic processes. Journal of Complexity, 22(6):768-782, 2006.

• Matthias Schröder and Alex Simpson. Two preservation results for countable products of sequential spaces. Mathematical Structures in Computer Science, 17:161-172, 2007.

• Matthias Schröder. Topological spaces allowing type 2 complexity theory. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 41-53. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Matthias Schröder. Welche topologischen Räume erlauben Typ2-Komplexitätstheorie? Informatik Berichte 178, FernUniversität Hagen, Hagen, May 1995.

• Matthias Schröder. Fast online multiplication of real numbers. In Rüdiger Reischuk and Michel Morvan, editors, STACS 97, volume 1200 of Lecture Notes in Computer Science, pages 81-92, Berlin, 1997. Springer. 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27-March 1, 1997.

• Matthias Schröder. Effective metrization of regular spaces. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 63-80. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Matthias Schröder. Online computations of differentiable functions. Theoretical Computer Science, 219:331-345, 1999.

• Matthias Schröder. Admissible representations of limit spaces. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 273-295, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Matthias Schröder. Admissible Representations for Continuous Computations. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 2002.

• Matthias Schröder. Effectivity in spaces with admissible multirepresentations. Mathematical Logic Quarterly, 48(Suppl. 1):78-90, 2002.

• Matthias Schröder. Extended admissibility. Theoretical Computer Science, 284(2):519-538, 2002.

• Matthias Schröder. A natural weak limit space with admissible representation which is not a limit space. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Matthias Schröder. Spaces allowing type-2 complexity theory revisited. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 345-361. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Matthias Schröder. Spaces allowing type-2 complexity theory revisited. Mathematical Logic Quarterly, 50(4,5):443-459, 2004.

• Matthias Schröder. Admissible representations in computable analysis. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 471-480, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Matthias Schröder. Admissible representations for probability measures. Mathematical Logic Quarterly, 53(4-5):431-445, 2007.

• Matthias Schröder. Admissible representations of probability measures. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 61-78, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Matthias Schröder. An effective Tietze-Urysohn theorem for QCB-spaces (extended abstract). In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 231-242. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Matthias Schröder. On the relationship between filter spaces and weak limit spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 267-277. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Matthias Schröder. On the relationship between filter spaces and weak limit spaces. Journal of Universal Computer Science, 14(6):996-1015, 2008.

• Holger Schulz. Type 2 theory of effectivity and real PCF. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 81-90. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Victor L. Selivanov. Classifying countable Boolean terms. Algebra and Logic, 44(2):95-108, 2005.

• Victor L. Selivanov. Hierarchies in varphi -spaces and applications. Mathematical Logic Quarterly, 51(1):45-61, 2005.

• Victor L. Selivanov. Variations on the Wadge reducibility. Siberian Advances in Math., 15(3):44-80, 2005.

• Victor L. Selivanov. Variations on Wadge reducibility (extended abstract). In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 159-171, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Victor L. Selivanov. Hierarchies of delta ⁰₂--measurable k--partitions. Mathematical Logic Quarterly, 53(4-5):446-461, 2007.

• Victor Selivanov. On the difference hierarchy in countably based t₀-spaces. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 257-269. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Victor Selivanov. On the Wadge reducibility of k-partitions. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 59-71. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Svetlana Selivanova and Victor Selivanov. Computing solutions of symmetric hyperbolic systems of PDE’s. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 243-255. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• J.C. Shepherdson. On the definition of computable function of a real variable. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22:391-402, 1976.

• Jakob G. Simonsen. Specker sequences revisited. Mathematical Logic Quarterly, 51(5):532-540, 2005.

• Jakob G. Simonsen. On local non-compactness in recursive mathematics. Mathematical Logic Quarterly, 52(4):323-330, 2006.

• Stephen G. Simpson. Almost everywhere domination and superhighness. Mathematical Logic Quarterly, 53(4-5):462-482, 2007.

• Stephen G. Simpson. Mass problems and almost everywhere domination. Mathematical Logic Quarterly, 53(4-5):483-492, 2007.

• Kostas Skandalis. Programmability in the set of real numbers and second-order recursion. Fundamenta Informaticae, 6(3-4):257-274, 1983.

• Kostas Skandalis. Programmable real numbers and functions. Fundamenta Informaticae, 7(1):27-56, 1984.

• Kostas Skandalis. Non-recursiveness of the operations on real numbers. Theoretical Computer Science, 71:425-429, 1990.

• Kostas Skandalis. Program computability over the real numbers. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 55-63. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

• Dimiter Skordev. Characterization of the computable real numbers by means of primitive recursive functions. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 296-309, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Dimiter Skordev. Computability of real numbers by using a given class of functions in the set of natural numbers. Mathematical Logic Quarterly, 48(Suppl. 1):91-106, 2002.

• Dimiter Skordev. Some subrecursive versions of Grzegorczyk's Uniformity Theorem. Mathematical Logic Quarterly, 50(4,5):520-524, 2004.

• Dimiter Skordev. E²-computability of e, pi and other famous constants. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 37-47. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Dimiter Skordev. On the subrecursive computability of several famous constants. Journal of Universal Computer Science, 14(6):861-875, 2008.

• R.I. Soare. Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math., 31:215-231, 1969.

• R.I. Soare. Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc., 140:271-294, 1969.

• Mark Sofroniou and Giulia Spaletta. Precise numerical computation. The Journal of Logic and Algebraic Programming, 64:113-134, 2005.

• Christoph Spandl. Computing the topological entropy of shifts. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 131-155, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Christoph Spandl. Computing the topological entropy of shifts. Mathematical Logic Quarterly, 53(4-5):493-510, 2007.

• Christoph Spandl. Computability of topological pressure for shifts of finite type with applications in statistical physics. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 385-401. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Christoph Spandl. Computability of topological pressure for sofic shifts with applications in statistical physics. Journal of Universal Computer Science, 14(6):876-895, 2008.

• Ernst Specker. Nicht konstruktiv beweisbare Sätze der Analysis. The Journal of Symbolic Logic, 14(3):145-158, 1949.

• Ernst Specker. Der Satz vom Maximum in der rekursiven Analysis. In A. Heyting, editor, Constructivity in mathematics, Studies in Logic and the Foundations of Mathematics, pages 254-265, Amsterdam, 1959. North-Holland. Proc. Colloq., Amsterdam, Aug. 26-31, 1957.

• Ernst Specker. The fundamental theorem of algebra in recursive analysis. In B. Dejon and P. Henrici, editors, Constructive Aspects of the Fundamental Theorem of Algebra, pages 321-329, London, 1969. Wiley-Interscience.

• Dieter Spreen and Holger Schulz. On the equivalence of some approaches to computability on the real line. In Klaus Keimel, Guo-Qiang Zhang, Ying Ming Liu, and Yixiang Chen, editors, Domains and processes, volume 1 of Semantics Structures in Computation, pages 67-101, Dordrecht, 2001. Kluwer. Proceedings of the 1st International Symposium on Domain Theory.

• Dieter Spreen and Paul Young. Effective operators in a topological setting. In M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, and W. Thomas, editors, Computation and Proof Theory, volume 1104 of Lecture Notes in Mathematics, pages 437-451, Berlin, 1984. Springer. Proceedings of the Logic Colloquium, Aachen, July 18-23, 1983, Part II.

• Dieter Spreen. Computable one-to-one enumerations of effective domains. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical foundations of programming language semantics, volume 298 of Lecture Notes in Computer Science, pages 372-384, Berlin, 1988. Springer.

• Dieter Spreen. A characterization of effective topological spaces. In K. Ambos-Spies, G. H. Müller, and G. E. Sacks, editors, Recursion theory week, volume 1432 of Lecture Notes in Mathematics, pages 363-387, Berlin, 1990. Springer. Proceedings of the conference held at the Mathematisches Forschungsinstitut, Oberwolfach, March 19-25, 1989.

• Dieter Spreen. Computable one-to-one enumerations of effective domains. Information and Computation, 84:26-46, 1990.

• Dieter Spreen. A characterization of effective topological spaces II. In Topology and category theory in computer science, pages 231-255, New York, 1991. Oxford Univ. Press. Oxford, 1989.

• Dieter Spreen. Effective operators and continuity revisited. In A. Nerode and M. Ta ui tslin, editors, Logical foundations of computer science, volume 620 of Lecture Notes in Computer Science, pages 459-469, Berlin, 1992. Springer.

• Dieter Spreen. On some decision problems in programming. Information and Computation, 122(1):120-139, 1995. (Corrigendum: Inform. and Comp. 148, 241-244, 1999).

• Dieter Spreen. Effective inseparability in a topological setting. Annals of Pure and Applied Logic, 80:257-275, 1996.

• Dieter Spreen. On effective topological spaces. The Journal of Symbolic Logic, 63(1):185-221, 1998.

• Dieter Spreen. Can partial indexings be totalized? The Journal of Symbolic Logic, 66(3):1157-1185, 2001.

• Dieter Spreen. Representations versus numberings: on the relationship of two computability notions. Theoretical Computer Science, 262:473-499, 2001.

• Dieter Spreen. Strong reducibilities for partial numberings. Archive for Mathematical Logic, 44(3):209-217, 2005.

• Dieter Spreen. On the continuity of effective multifunctions. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 271-286. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Ludwig Staiger and Klaus Weihrauch. In the Cantor space and Baire space, G_ delta setminus F_ sigma is a single Wadge-degree, an effective proof. Informatik Berichte 119, FernUniversität Hagen, Hagen, January 1992.

• Ludwig Staiger. The Kolmogorov complexity of real numbers. In G. Ciobanu and Gh. Paun, editors, Fundamentals of Computation Theory, volume 1684 of Lecture Notes in Computer Science, pages 536-546, Berlin, 1999. Springer.

• Ludwig Staiger. How large is the set of disjunctive sequences ? Journal of Universal Computer Science, 8(2):348-362, 2002.

• Ludwig Staiger. The Kolmogorov complexity of real numbers. Theoretical Computer Science, 284(2):455-466, 2002.

• Ludwig Staiger. On oscillation-free varepsilon -random sequences. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 287-297. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Kristian Jon Stewart. Concrete and Abstract Models of Computation over Metric Algebras. PhD thesis, University of Wales Swansea, Singleton Park, Swansea, SA2 8PP, UK, 1999.

• Viggo Stoltenberg-Hansen and John V. Tucker. Effective algebras. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 4, pages 357-527, Oxford, 1995. Clarendon Press.

• Viggo Stoltenberg-Hansen and John V. Tucker. Concrete models of computation for topological algebras. Theoretical Computer Science, 219:347-378, 1999.

• Viggo Stoltenberg-Hansen and John V. Tucker. Computable and continuous partial homomorphisms on metric partial algebras. Bulletin of Symbolic Logic, 9(3):299-334, 2003.

• Philipp Sünderhauf. 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.

• Philipp Sünderhauf. A faithful computational model of the real numbers. Theoretical Computer Science, 151:277-294, 1995.

• Kohtaro Tadaki. Upper bound by Kolmogorov complexity for the probability in computable quantum measurement. In Marc et al. Daumas, editor, RNC'5 Real Numbers and Computers, pages 193-214. INRIA, Institut National de Recherche en Informatique et en Automatique, 2003. Lyon, September 3-5, 2003.

• Kohtaro Tadaki. An extension of Chaitin's halting probability omega to measurement operator in infinite dimensional quantum system. In Christiane Frougny, Vasco Brattka, and Norbert Müller, editors, RNC'6 Real Numbers and Computers, pages 172-191. Fachbereich Mathematik/Informatik, Universität Trier, 2004. Dagstuhl, Germany, November 15-17, 2004.

• Kohtaro Tadaki. An extension of Chaitin's halting probability Omega to a measurement operator in an infinite dimensional quantum system. Mathematical Logic Quarterly, 52(5):419-438, 2006.

• Izumi Takeuti. Effective fixed point theorem over a non-computably separable metric space. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 310-322, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Izumi Takeuti. Effective limit in computable analysis. In Marc et al. Daumas, editor, RNC'5 Real Numbers and Computers, pages 161-175. INRIA, Institut National de Recherche en Informatique et en Automatique, 2003. Lyon, September 3-5, 2003.

• Izumi Takeuti. Transition systems over continuous time-space. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 173-186, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Paul Taylor. A lambda calculus for real analysis. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 227-266. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Sebastiaan Augustinus Terwijn. Computability and Measure. PhD thesis, Institute for Logic, Language and Computation, University Amsterdam, 1998.

• Konrad R. Theobald. Eine allgemeine Theorie der Stetigkeit und Berechenbarkeit für natürliche Halbordnungen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984.

• A.S. Troelstra. Comparing the theory of representations and constructive mathematics. In E. Börger, G. Jäger, H. Kleine Büning, and M.M. Richter, editors, Computer Science Logic, volume 626 of Lecture Notes in Computer Science, pages 382-395, Berlin, 1992. Springer. Proceedings of the 5th Workshop, CSL'91, Berne Switzerland, October 1991.

• Hideki Tsuiki and Shuji Yamada. On finite-time computability preserving conversions. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 299-308. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Hideki Tsuiki. Grey code representation of exact real numbers. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 91-102. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Hideki Tsuiki. Computational dimension of topological spaces. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 323-335, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Hideki Tsuiki. Real number computation through Gray code embedding. Theoretical Computer Science, 284(2):467-485, 2002.

• Hideki Tsuiki. Representations of complete uniform spaces via uniform domains. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Hideki Tsuiki. Compact metric spaces as minimal-limit sets in domains of bottomed sequences. Mathematical Structures in Computer Science, 14:853-878, 2004.

• Hideki Tsuiki. Dyadic subbases and efficiency properties of the induced {0, 1, bot }^ omega --representations. Topology Proceedings, 28(2):673-687, 2004.

• Hideki Tsuiki. Real number computation with committed choice logic programming languages. The Journal of Logic and Algebraic Programming, 64:61-84, 2005.

• Yoshiki Tsujii, Mariko Yasugi, and Takakazu Mori. Some properties of the effective uniform topological space. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 336-356, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Yoshiki Tsujii, Mariko Yasugi, and Takakazu Mori. Sequential computability of a function: Diagonal space and limiting recursion. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 187-199, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• J.V. Tucker and J.I. Zucker. Examples of semicomputable sets of real and complex numbers. In J.P. Myers and M.J. O'Donnell, editors, Constructivity in computer science, pages 179-198, Berlin, 1992. Springer. Summer Symposium San Antonio, TX, June 19-22, 1991.

• J.V. Tucker and J.I. Zucker. Computation by `While' programs on topological partial algebras. Theoretical Computer Science, 219:379-420, 1999.

• J.V. Tucker and J.I. Zucker. Computable functions and semicomputable sets on many-sorted algebras. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 5, pages 317-523, Oxford, 2000. Oxford University Press.

• J.V. Tucker and J.I. Zucker. Abstract computability and algebraic specification. ACM Transactions on Computational Logic, 3(2):279-333, 2002.

• J.V. Tucker and J.I. Zucker. Abstract versus concrete computation on metric partial algebras. ACM Transactions on Computational Logic, 5(4):611-668, 2004.

• John V. Tucker and Jeffery I. Zucker. A network model of analogoue computation over metric algebras. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 515-529, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• J.V. Tucker and J.I. Zucker. Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. The Journal of Logic and Algebraic Programming, 62:71-108, 2005.

• John V. Tucker and Jeffery I. Zucker. Computability of analog networks. Theoretical Computer Science, 371(1-2):115-146, 2007.

• Alan M. Turing. On computable numbers, with an application to the ``Entscheidungsproblem''. Proceedings of the London Mathematical Society, 42(2):230-265, 1936.

• Alan M. Turing. On computable numbers, with an application to the ``Entscheidungsproblem''. A correction. Proceedings of the London Mathematical Society, 43(2):544-546, 1937.

• Ju. R. Va ui nberg and Elena Ju. Nogina. Categories of effectively topological spaces. In Studies in formalized languages and nonclassical logics (Russian), pages 253-273. Izdat. ``Nauka'', Moscow, 1974.

• Ju. R. Va ui nberg and Elena Ju. Nogina. Two types of continuity of computable mappings of numerated topological spaces. In Studies in the theory of algorithms and mathematical logic, Vol. 2 (Russian), pages 84-99, 159. Vy v cisl. Centr Akad. Nauk SSSR, Moscow, 1976.

• Joris van der Hoeven. Computations with effective real numbers. Theoretical Computer Science, 351(1):52-60, 2006.

• Joris van der Hoeven. Effective real numbers in Mmxlib. In Jean-Guillaume Dumas, editor, International Conference on Symbolic and Algebraic Computation, pages 138-145. ACM Press, 2006. Proceedings of the International Symposium on Symbolic and Algebraic Computations ISSAC, Genoa, Italy, July 9-12, 2006.

• Klaus Wagner. Arithmetische Operatoren. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22:553-570, 1976.

• Klaus Wagner. Arithmetische und Bairesche Operatoren. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 23:181-191, 1977.

• Hao Wang. Specker's mathematical work from 1949 to 1979. In Logic and Algorithmic (Zürich, 1980), volume 30, pages 11-24. Univ. Geneva, 1982.

• Masako Washihara and Mariko Yasugi. Computability and metrics in a Fréchet space. Mathematica Japonica, 43(3):431-443, 1996.

• Masako Washihara. Computability and Fréchet spaces. Mathematica Japonica, 42(1):1-13, 1995.

• Masako Washihara. Computability and tempered distributions. Mathematica Japonica, 50(1):1-7, 1999.

• Klaus Weihrauch and Thomas Deil. Berechenbarkeit auf cpo-s. Schriften zur Informatik und angewandten Mathematik 63, Technische Hochschule Aachen, Aachen, 1980. Eine Vorlesung von Klaus Weihrauch ausgearbeitet von Thomas Deil.

• Klaus Weihrauch and Christoph Kreitz. Representations of the real numbers and of the open subsets of the set of real numbers. Annals of Pure and Applied Logic, 35:247-260, 1987.

• Klaus Weihrauch and Christoph Kreitz. Type 2 computational complexity of functions on Cantor's space. Theoretical Computer Science, 82:1-18, 1991. Fundamental Study.

• Klaus Weihrauch and Giesela Schäfer. Admissible representations of effective cpo's. In J. Gruska and M. Chytil, editors, Mathematical Foundations of Computer Science 1981, volume 118 of Lecture Notes in Computer Science. Springer, 1981. Proceedings, 10th Sympsoium Strbské Pleso, Czechoslovakia, August 31-September 4, 1981.

• Klaus Weihrauch and G. Schäfer. Admissible representations of effective cpo's. Theoretical Computer Science, 26:131-147, 1983.

• Klaus Weihrauch and Ulrich Schreiber. Metric spaces defined by weighted algebraic cpo-s. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT'79, pages 516-522, Berlin, 1979. Akademie-Verlag. Proceedings of the Conference on Algebraic, Arithmetic, and Categorial Methods in Computation Theory, Berlin, September 17-21, 1979.

• Klaus Weihrauch and Ulrich Schreiber. Embedding metric spaces into cpo-s. Informatik Berichte 2, FernUniversität Hagen, Hagen, April 1980.

• Klaus Weihrauch and Ulrich Schreiber. Embedding metric spaces into cpo's. Theoretical Computer Science, 16:5-24, 1981.

• Klaus Weihrauch and Xizhong Zheng. Computability on continuous, lower semi-continuous and upper semi-continuous real functions. In Tao Jiang and D.T. Lee, editors, Computing and Combinatorics, volume 1276 of Lecture Notes in Computer Science, pages 166-175, Berlin, 1997. Springer. Third Annual Conference, COCOON'97, Shanghai, China, August 1997.

• Klaus Weihrauch and Xizhong Zheng. A finite hierarchy of the recursively enumerable real numbers. In Lubos Brim, Jozef Gruska, and Jirí Zlatuska, editors, Mathematical Foundations of Computer Science 1998, volume 1450 of Lecture Notes in Computer Science, pages 798-806, Berlin, 1998. Springer. 23rd International Symposium, MFCS'98, Brno, Czech Republic, August, 1998.

• Klaus Weihrauch and Xizhong Zheng. Effectiveness of the global modulus of continuity on metric spaces. Theoretical Computer Science, 219:439-450, 1999.

• Klaus Weihrauch and Xizhong Zheng. Computability on continuous, lower semi-continuous and upper semi-continuous real functions. Theoretical Computer Science, 234:109-133, 2000.

• Klaus Weihrauch and Ning Zhong. The wave propagator is Turing computable. In Jirí Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 697-706, Berlin, 1999. Springer. 26th International Colloquium, ICALP'99, Prague, Czech Republic, July, 1999.

• Klaus Weihrauch and Ning Zhong. Is the linear Schrödinger propagator Turing computable? In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 369-377, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Klaus Weihrauch and Ning Zhong. Turing computability of a nonlinear Schrödinger propagator. Informatik Berichte 285, FernUniversität Hagen, Hagen, May 2001.

• Klaus Weihrauch and Ning Zhong. Turing computability of a nonlinear Schrödinger propagator. In Jie Wang, editor, Computing and Combinatorics, volume 2108 of Lecture Notes in Computer Science, pages 596-599, Berlin, 2001. Springer. 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001.

• Klaus Weihrauch and Ning Zhong. Is wave propagation computable or can wave computers beat the Turing machine? Proceedings of the London Mathematical Society, 85(2):312-332, 2002.

• Klaus Weihrauch and Ning Zhong. The solution operator of the Korteweg-de Vries equation is computable. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Klaus Weihrauch and Ning Zhong. The solution operator of the Korteweg-de Vries equation is computable. Informatik Berichte 293, FernUniversität Hagen, Hagen, June 2002.

• Klaus Weihrauch and Ning Zhong. An algorithm for computing fundamental solutions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 201-215, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Klaus Weihrauch and Ning Zhong. Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines. Theoretical Computer Science, 332(1-3):337-366, 2005.

• Klaus Weihrauch and Ning Zhong. An algorithm for computing fundamental solutions. SIAM Journal on Computing, 35(6):1283-1294, 2006.

• Klaus Weihrauch and Ning Zhong. Computing Schrödinger propagators on Type-2 Turing machines. Journal of Complexity, 22(6):918-935, 2006.

• Klaus Weihrauch and Ning Zhong. Computable analysis of the abstract Cauchy problem in a Banach space and its applications (I). In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 33-59, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Klaus Weihrauch and Ning Zhong. Computable analysis of the abstract Cauchy problem in a Banach space and its applications I. Mathematical Logic Quarterly, 53(4-5):511-531, 2007.

• Klaus Weihrauch. A generalized computability thesis. In Marek Karpinski, editor, Fundamentals of Computation Theory, volume 56 of Lecture Notes in Computer Science, pages 538-542. Springer, 1977. Proceedings of the 1977 International FCT-Conference, Poznan-Kornik, Poland, September 19-23, 1977.

• Klaus Weihrauch. Computability on metric spaces. Informatik Berichte 21, FernUniversität Hagen, Hagen, September 1981.

• Klaus Weihrauch. Recursion and complexity theory on cpo-s. In Peter Deussen, editor, Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer, 1981. 5th GI-Conference, Karlsruhe, March 23-25, 1981.

• Klaus Weihrauch. On natural numberings and representations. Informatik Berichte 29, FernUniversität Hagen, Hagen, December 1982.

• Klaus Weihrauch. Type 2 recursion theory. Theoretical Computer Science, 38:17-33, 1985.

• Klaus Weihrauch. Computability, volume 9 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1987.

• Klaus Weihrauch. The lowest Wadge-degrees of subsets of the Cantor space. Informatik Berichte 107, FernUniversität Hagen, Hagen, April 1991.

• Klaus Weihrauch. On the complexity of online computations of real functions. Journal of Complexity, 7:380-394, 1991.

• Klaus Weihrauch. The degrees of discontinuity of some translators between representations of the real numbers. Technical Report TR-92-050, International Computer Science Institute, Berkeley, July 1992.

• Klaus Weihrauch. The degrees of discontinuity of some translators between representations of the real numbers. Informatik Berichte 129, FernUniversität Hagen, Hagen, July 1992.

• Klaus Weihrauch. The TTE-interpretation of three hierarchies of omniscience principles. Informatik Berichte 130, FernUniversität Hagen, Hagen, September 1992.

• Klaus Weihrauch. Computability on computable metric spaces. Theoretical Computer Science, 113:191-210, 1993. Fundamental Study.

• Klaus Weihrauch. A simple introduction to computable analysis. Informatik Berichte 171, FernUniversität Hagen, Hagen, July 1995. 2nd edition.

• Klaus Weihrauch. A foundation for computable analysis. In Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten, editors, Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, pages 66-89, Singapore, 1997. Springer. Proceedings of DMTCS'96.

• Klaus Weihrauch. Random real numbers. Informatik Berichte 219, FernUniversität Hagen, Hagen, June 1997.

• Klaus Weihrauch. A refined model of computation for continuous problems. Journal of Complexity, 14:102-121, 1998.

• Klaus Weihrauch. Computability on the probability measures on the Borel sets of the unit interval. Theoretical Computer Science, 219:421-437, 1999.

• Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000.

• Klaus Weihrauch. On computable metric spaces Tietze-Urysohn extension is computable. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 357-368, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Klaus Weihrauch. Computable analysis. In B.D. Masurov et al., editor, Proceedings of the international conference ``Logic and Applications'' honouring Yu. L. Ershov on his 60th birthday, pages 165-178, Novosibirsk, 2002. University of Novosibirsk.

• Klaus Weihrauch. Computational complexity on computable metric spaces. Mathematical Logic Quarterly, 49(1):3-21, 2003.

• Klaus Weihrauch. Continuity in computable analysis (abstract). In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 99-100. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Klaus Weihrauch. Multi-functions on multi-represented sets are closed under flowchart programming. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 267-300. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Klaus Weihrauch. The computable multi-functions on multi-represented sets are closed under programming. Journal of Universal Computer Science, 14(6):801-844, 2008.

• Jirí Wiedermann and Jan van Leeuwen. Relativistic computers and non-uniform complexity theory. In Cristian S. Calude, Michael J. Dinneen, and Ferdinand Peper, editors, Unconventional models of computation, volume 2509 of Lecture Notes in Computer Science, pages 287-299, Berlin, 2002. Springer. Proceedings of the 3rd International Conference (UMC 2002) held in Kobe, Japan, October 15-19, 2002.

• E. Wiedmer. Computing with infinite objects. Theoretical Computer Science, 10:133-155, 1980.

• Kam-Chau Wong. Computability of minimizers and separating hyperplanes. Mathematical Logic Quarterly, 42:564-568, 1996.

• Henryk Wozniakowski. Why does information-based complexity use the real number model? Theoretical Computer Science, 219:451-465, 1999.

• Yongcheng Wu and Decheng Ding. Computability of measurable sets via effective metrics. Mathematical Logic Quarterly, 51(6):543-559, 2005.

• Yongcheng Wu and Decheng Ding. Computability of measurable sets via effective topologies. Archive for Mathematical Logic, 45(3):365-379, 2006.

• Yongcheng Wu and Klaus Weihrauch. A computable version of the Daniell-Stone theorem on integration and linear functionals. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 217-230, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Yongcheng Wu and Klaus Weihrauch. A computable version of the Daniell-Stone theorem on integration and linear functionals. Theoretical Computer Science, 359(1-3):28-42, 2006.

• Guohua Wu. Regular reals. Mathematical Logic Quarterly, 51(2):111-119, 2005.

• Yatao Xu and Tanja Grubba. Computability on subsets of locally compact spaces. In J.-Y. Cai, S.B. Cooper, and H. Zhu, editors, Theory and Applications of Models of Computation, volume 4484 of Lecture Notes in Computer Science, pages 100-114, Berlin, 2007. Springer. 4th International Conference, TAMC 2007, Shanghai, China, May 2007.

• Takeshi Yamaguchi. On index sets of recursive reals. Draft, 1995.

• Mariko Yasugi and Yoshiki Tsujii. Two notions of sequential computability of a function with jumps. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Mariko Yasugi and Yoshiki Tsujii. Computability of a function with jumps -- effective uniformity and limiting recursion. Topology and its Applications, 146-147:563-582, 2005.

• Mariko Yasugi and Masako Washihara. A note on Rademacher functions and computability. In Masami Ito and Teruo Imaoka, editors, Words, Languages & Combinatorics III, pages 466-475, Singapore, 2003. World Scientific Publishing. ICWLC 2000, Kyoto, Japan, March 14-18, 2000.

• Mariko Yasugi, Takakazu Mori, and Yoshiki Tsujii. Effective properties of sets and functions in metric spaces with computability structure. Theoretical Computer Science, 219:467-486, 1999.

• Mariko Yasugi, Vasco Brattka, and Masako Washihara. Computability aspects of some discontinuous functions. Scientiae Mathematicae Japonicae Online, 5:405-419, 2001.

• Mariko Yasugi, Vasco Brattka, and Masako Washihara. Computability aspects of some discontinuous functions. Scientiae Mathematicae Japonicae, 55(3):427-441, 2002.

• Mariko Yasugi, Vasco Brattka, and Masako Washihara. Limit computation of some discontinuous functions. In Theoretical development and feasibility of mathematical analysis on the computer, volume 1286 of Surikaisekikenkyusho Kokyuroku, pages 79-84, Kyoto, 2002. Research Institute for Mathematical Sciences.

• Mariko Yasugi, Yoshiki Tsujii, and Takakazu Mori. Metrization of the uniform space and effective convergence. Mathematical Logic Quarterly, 48(Suppl. 1):123-130, 2002.

• Mariko Yasugi, Takakazu Mori, and Yoshiki Tsujii. Effective sequence of uniformities and its effective limit. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 301-318. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Mariko Yasugi, Yoshiki Tsujii, and Takakazu Mori. Sequential computability of a function. effective Fine space and limiting recursion. Journal of Universal Computer Science, 11(12):2179-2191, 2005.

• Mariko Yasugi, Takakazu Mori, and Yoshiki Tsujii. The effective sequence of uniformities and its limit as a methodology in computable analysis. Annals of the Japan Association for Philosophy of Science, 15(2):99-121, 2007.

• Mariko Yasugi. Computability in analysis. Surikaisekikenkyusho-Kokyuroku, 850:207-214, 1993. Workshop on Stochastic Numerics, Kyoto.

• Mariko Yasugi. Computability problem of Gaussian function. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 157-165. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Mariko Yasugi. How to understand the computability aspects of step functions. Surikaisekikenkyusho Kokyuroku, 1169:84-91, 2000. Research Institute for Mathematical Sciences Kyoto.

• Atsushi Yoshikawa. Interpolation functor and computability. Theoretical Computer Science, 284(2):487-498, 2002.

• Atsushi Yoshikawa. On an ad hoc computability structure in a Hilbert space. Proc. Japan Acad. Ser. A, 79(3):65-70, 2003.

• Atsushi Yoshikawa. On computability of the Galerkin procedure. Proc. Japan Acad. Ser. A, 83(5):69-72, 2007.

• Liang Yu, Decheng Ding, and Rodney Downey. The Kolmogorov complexity of random reals. Annals of Pure and Applied Logic, 129(1-3):163-180, 2004.

• Fuxiang Yu, Arthur Chou, and Ker-I Ko. On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. Journal of Complexity, 22(6):803-817, 2006.

• Fuxiang Yu. On the complexity of the pancake problem. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 95-115, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Fuxiang Yu. On the complexity of the pancake problem. Mathematical Logic Quarterly, 53(4-5):532-546, 2007.

• Xishun Zhao and Norbert Müller. Complexity of operators on compact sets. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 101-119. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Xizhong Zheng and George Barmpalias. On the monotonic computability of semi-computable real numbers. In Cristian S. Calude, Michael J. Dinneen, and Vincent Vajnovszki, editors, Discrete Mathematics and Theoretical Computer Science, volume 2731 of Lecture Notes in Computer Science, pages 290-300, Berlin, 2003. Springer. DMTCS 2003, 4th International Conference, July 7-12, 2003, Dijon.

• Xizhong Zheng and Robert Rettinger. h--Monotonically computable real numbers. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 375-388. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Xizhong Zheng and Robert Rettinger. Weak computability and representation of reals. Mathematical Logic Quarterly, 50(4,5):431-442, 2004.

• Xizhong Zheng and Robert Rettinger. Effective Jordan decomposition. Theory of Computing Systems, 38(2):189-209, 2005.

• Xizhong Zheng and Robert Rettinger. A note on the Turing degrees of divergence bounded computable reals. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 231-237, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Xizhong Zheng and Robert Rettinger. On the extensions of Solovay reducibility. In Kyung-Yong Chwa and J. Ian Munro, editors, Computing and Combinatorics, volume 3106 of Lecture Notes in Computer Science, pages 360-369, Berlin, 2005. Springer. 10th Annual International Conference, COOCON 2004, Jeju Island, Korea, August 17-20, 2004.

• Xizhong Zheng and Klaus Weihrauch. The arithmetical hierarchy of real numbers. In Miroslaw Kutylowski, Leszek Pacholski, and Tomasz Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, volume 1672 of Lecture Notes in Computer Science, pages 23-33, Berlin, 1999. Springer. 24th International Symposium, MFCS'99, Szklarska Por c eba, Poland, September, 1999.

• Xizhong Zheng and Klaus Weihrauch. The arithmetical hierarchy of real numbers. Mathematical Logic Quarterly, 47(1):51-65, 2001.

• Xizhong Zheng, Vasco Brattka, and Klaus Weihrauch. Approaches to effective semi-continuity of real functions. Mathematical Logic Quarterly, 45(4):481-496, 1999.

• Xizhong Zheng, Robert Rettinger, and Burchard von Braunmühl. Effectively absolute continuity and effective Jordan decomposability. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

• Xizhong Zheng, Robert Rettinger, and Romain Gengler. Ershov's hierarchy of real numbers. In B. Rovan and P. Vojtas, editors, Mathematical Foundations of Computer Science 2003, volume 2747 of Lecture Notes in Computer Science, pages 681-690, Berlin, 2003. Springer. MFCS 2003, August 25-29, 2003, Bratislava, Slovakia.

• Xizhong Zheng, Robert Rettinger, and Burchard von Braunmühl. On the effective Jordan decomposability. In Helmut Alt and Michel Habib, editors, STACS 2003, volume 2607 of Lecture Notes in Computer Science, pages 167-178, Berlin, 2003. Springer. 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27-March 1, 2003.

• Xizhong Zheng, Robert Rettinger, and George Barmpalias. h-monotonically computable real numbers. Mathematical Logic Quarterly, 51(2):157-170, 2005.

• Xizhong Zheng, Robert Rettinger, and Romain Gengler. Closure properties of real numbers classes under CBV functions. Theory of Computing Systems, 38:701-729, 2005.

• Xizhong Zheng, Dianchen Lub, and Kejin Bao. Divergence bounded computable real numbers. Theoretical Computer Science, 351(1):27-38, 2006.

• Xizhong Zheng. Weak Computability and Semi-Computability in Analysis. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1998.

• Xizhong Zheng. Binary enumerability of real numbers. In Takao Asana, Hiroshi Imai, D.T. Lee, Shin-ichi Nakano, and Takeshi Tokuyama, editors, Computing and Combinatorics, volume 1627 of Lecture Notes in Computer Science, pages 300-309, Berlin, 1999. Springer. 5th Annual Conference, COCOON'99, Tokyo, Japan, July 1999.

• Xizhong Zheng. The closure properties on real numbers under limits and computable operators. Theoretical Computer Science, 284(2):499-518, 2002.

• Xizhong Zheng. Recursive approximability of real numbers. Mathematical Logic Quarterly, 48(Suppl. 1):131-156, 2002.

• Xizhong Zheng. On the divergence bounded computable real numbers. In Tandy Warnow and Binhai Zhu, editors, Computing and Combinatorics, volume 2697 of Lecture Notes in Computer Science, pages 102-111, Berlin, 2003. Springer. COOCON 2003, 9th Annual International Conference, July 25-28, 2003, Big Sky, MT, USA.

• Xizhong Zheng. On the Turing degrees of weakly computable real numbers. Journal of Logic and Computation, 13(2):159-172, 2003.

• Xizhong Zheng. On the hierarchy of delta ⁰₂--real numbers. In Christiane Frougny, Vasco Brattka, and Norbert Müller, editors, RNC'6 Real Numbers and Computers, pages 192-216. Fachbereich Mathematik/Informatik, Universität Trier, 2004. Dagstuhl, Germany, November 15-17, 2004.

• Xizhong Zheng. A computability theory of real numbers. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 584-594, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Xizhong Zheng. Classification of the computable approximations by divergence boundings. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 325-344, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Xizhong Zheng. On the hierarchies of Delta ⁰₂--real numbers. Theoretical Informatics and Applications, 41(1):3-25, 2007.

• Xizhong Zheng. Finitely bounded effective computability. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 255-265. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Ning Zhong and Klaus Weihrauch. Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen, September 2000.

• Ning Zhong and Klaus Weihrauch. Computability theory of generalized functions. Journal of the Association for Computing Machinery, 50(4):469-505, 2003.

• Ning Zhong and Bing-Yu Zhang. L^p-computability. Mathematical Logic Quarterly, 45(4):449-456, 1999.

• Ning Zhong. Effective separation axioms. Questions and Answers in General Topology, 14(2):177-185, 1996.

• Ning Zhong. Effective collectionwise Hausdorff and normal axioms. Questions and Answers in General Topology, 15(2):225-230, 1997.

• Ning Zhong. Derivatives of computable functions. Mathematical Logic Quarterly, 44:304-316, 1998.

• Ning Zhong. Recursively enumerable subsets of R^q in two computing models: Blum-Shub-Smale machine and Turing machine. Theoretical Computer Science, 197:79-94, 1998.

• Ning Zhong. Computability structure of the Sobolev spaces and its applications. Theoretical Computer Science, 219:487-510, 1999.

• Ning Zhong. Computable analysis of a non-homogeneous boundary-value problem for the Korteweg-de Vries equation. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 552-561, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Ning Zhong. Computable analysis of a boundary-value problem for the Korteweg-de Vries equation. Theory of Computing Systems, 41(1):155-175, 2007.

• Qing Zhou and Weihao Hu. Decidability in analysis. Computing, 75:319-336, 2005.

• Qing Zhou. Computability on open and closed subsets of Euclidean space. Thesis, University of Minnesota, Minneapolis, 1992.

• Qing Zhou. Computable real-valued functions on recursive open and closed subsets of Euclidean space. Mathematical Logic Quarterly, 42:379-409, 1996.

• Qing Zhou. Subclasses of computable real valued functions. In Tao Jiang and D.T. Lee, editors, Computing and Combinatorics, volume 1276 of Lecture Notes in Computer Science, pages 156-165, Berlin, 1997. Springer. Third Annual Conference, COCOON'97, Shanghai, China, August 1997.

• Qing Zhou. Grzegorczyk's hierarchy of computable analysis. Theoretical Computer Science, 243:449-466, 2000.

• Qing Zhou. Relatively computable functions of real variables. Computing, 67(2):167-181, 2001.

• Martin Ziegler and Vasco Brattka. Computing the dimension of linear subspaces. In Václav Hlavác, Keith G. Jeffery, and Jirí Wiedermann, editors, SOFSEM 2000: Theory and Practice of Informatics, volume 1963 of Lecture Notes in Computer Science, pages 450-458, Berlin, 2000. Springer. 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25-December 2, 2000.

• Martin Ziegler and Vasco Brattka. A computable spectral theorem. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 378-388, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Martin Ziegler and Vasco Brattka. Turing computability of (non-)linear optimization. In Therese Biedl, editor, Thirteenth Canadian Conference on Computational Geometry, pages 181-184. University of Waterloo, 2001. CCCG 2001, August 13-15, 2001.

• Martin Ziegler and Vasco Brattka. Computability in linear algebra. Theoretical Computer Science, 326(1-3):187-211, 2004.

• Martin Ziegler. Computability on regular subsets of Euclidean space. Mathematical Logic Quarterly, 48(Suppl. 1):157-181, 2002.

• Martin Ziegler. Zur Berechenbarkeit reeller geometrischer Probleme. PhD thesis, Fachbereich Mathematik/Informatik, Universität Paderborn, Paderborn, 2002.

• Martin Ziegler. Computable operators on regular sets. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 389-406. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Martin Ziegler. Stability versus speed in a computable algebraic model. In Marc et al. Daumas, editor, RNC'5 Real Numbers and Computers, pages 47-64. INRIA, Institut National de Recherche en Informatique et en Automatique, 2003. Lyon, September 3-5, 2003.

• Martin Ziegler. Computable operators on regular sets. Mathematical Logic Quarterly, 50(4,5):392-404, 2004.

• Martin Ziegler. Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism. In Barry S. Cooper, Benedikt Löwe, and Leen Torenvliet, editors, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 562-571, Berlin, 2005. Springer. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005.

• Martin Ziegler. Effectively open real functions. Journal of Complexity, 22(6):827-849, 2006.

• Martin Ziegler. Stability versus speed in a computable algebraic model. Theoretical Computer Science, 351(1):14-26, 2006.

• Martin Ziegler. Real hypercomputation and continuity. Theory of Computing Systems, 41(1):177-206, 2007.

• Martin Ziegler. Revising type-2 computation and degrees of discontinuity. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 255-274, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Martin Ziegler. (Short) survey of real hypercomputation. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 809-824, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

Intuitionistic and Constructive Analysis

• G. Baigger. Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes. Arch. Math. Logik Grundlag., 25:183-188, 1985.

• R. Baire. Sur les fonctions des variables reeles. Annali di matematica pura ed applicata, 3:1-123, 1899.

• M. A. Baroni and D. S. Bridges. Continuity properties of preference relations. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 19-25. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Marian A. Baroni and Douglas S. Bridges. Continuity properties of preference relations. Mathematical Logic Quarterly, 54(5):454-459, 2008.

• Marian Alexandru Baroni. Constructive suprema. Journal of Universal Computer Science, 11(12):1865-1877, 2005.

• M.J. Beeson. Problematic principles in constructive mathematics. In Logic Colloquium '80, volume 108 of Studies in Logic and the Foundations of Mathematics, pages 11-55, Amsterdam, 1980. North-Holland.

• M.J. Beeson. Foundations of Constructive Mathematics. Ergeb. Math. Grenzgeb. Springer, Berlin, 1985.

• Josef Berger and Douglas S. Bridges. A bizarre property equivalent to the Pi ⁰₁--fan theorem. Logic Journal of the IGPL, 14:867-871, 2006.

• Josef Berger and Douglas S. Bridges. A fan-theoretic equivalent of the antithesis of Specker's theorem. Indag. Math. N.S., 18(2):195-202, 2007.

• Josef Berger and Douglas Bridges. The anti-Specker property, a Heine–Borel property. Archive for Mathematical Logic, 46(7-8):583–--592, 2008.

• Josef Berger and Hajime Ishihara. Brouwer's fan theorem and unique existence in constructive analysis. Mathematical Logic Quarterly, 51(4):360-364, 2005.

• Josef Berger, Douglas S. Bridges, and Peter Schuster. The fan theorem and unique existence of maxima. The Journal of Symbolic Logic, 71(2):713-720, 2006.

• Josef Berger. Constructive equivalents of the uniform continuity theorem. Journal of Universal Computer Science, 11(12):1878-1883, 2005.

• Josef Berger. Exact calculation of inverse functions. Mathematical Logic Quarterly, 51(2):201-205, 2005.

• Josef Berger. The logical strength of the uniform continuity theorem. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 35-39, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Errett Bishop and Douglas S. Bridges. Constructive Analysis, volume 279 of Grundlehren der Mathematischen Wissenschaften. Springer, Berlin, 1985.

• E. Bishop and H. Cheng. Constructive Measure Theory. American Mathematical Society, Providence, 1972.

• Errett Bishop. Constructive Methods in the Theory of Banach Algebras. In F.T. Birtel, editor, Function Algebras, pages 343-345, Chicago, 1966. Scott-Foresman. Proc. Internat. Sympos. on Function Algebras, Tulane Univ., 1965.

• Errett Bishop. Foundations of Constructive Analysis. McGraw-Hill, New York, 1967.

• Errett Bishop. A constructive ergodic theorem. J. Math. Mech., 17:631-639, 1967/1968.

• Errett Bishop. The constructivization of abstract mathematical analysis. Izdat. Mir, pages 308-313, 1968. Proc. Internat. Congr. Math., Moscow, 1968.

• Douglas Bridges and Luminita Dediu. Paradise lost, or paradise regained? Bulletin of the European Association for Theoretical Computer Science, 63:141-155, 1997.

• Douglas Bridges and Luminita Dediu. Weak continuity properties in constructive analysis. Logic Journal of the IGPL. Interest Group in Pure and Applied Logics, 7(3):277-281, 1999.

• Douglas Bridges and Luminita Dediu. Weak-operator continuity and the existence of adjoints. Mathematical Logic Quarterly, 45(2):203-206, 1999.

• Douglas Bridges and Luminita Dediu. The weak-operator sequential continuity of left multiplication. Indagationes Mathematicae, 11(1):39-42, 2000.

• Douglas Bridges and Osvald Demuth. On the Lebesgue measurability of continuous functions in constructive analysis. BAMS, 24(2):259-276, 1991.

• Douglas Bridges and Hannes Diener. A constructive treatment of Urysohn's Lemma in an apartness space. Mathematical Logic Quarterly, 52(5):464-469, 2006.

• D. S. Bridges and N. F. Dudley Ward. Constructing ultraweakly continuous functionals on B(H). Proceedings of the American Mathematical Society, 126(11):3347-3353, 1998.

• Douglas Bridges and Robin Havea. A constructive analysis of a proof that the numerical range is convex. London Math. Soc. Journal of Mathematics and Computation, 3:191-206, 2000.

• Douglas Bridges and Robin Havea. A constructive version of the spectral mapping theorem. Mathematical Logic Quarterly, 47(3):299-304, 2001.

• Douglas S. Bridges and Robin Havea. Powers of a Hermitian element. New Zealand J. Math., 36:1-10, 2007.

• Douglas Bridges and Hajime Ishihara. Linear mappings are fairly well-behaved. Archiv der Mathematik. Archives of Mathematics. Archives Mathématiques, 54(6):558-562, 1990.

• Douglas Bridges and Hajime Ishihara. Locating the range of an operator on a Hilbert space. The Bulletin of the London Mathematical Society, 24(6):599-605, 1992.

• Douglas Bridges and Hajime Ishihara. Absolute continuity and the uniqueness of the constructive functional calculus. Mathematical Logic Quarterly, 40(4):519-527, 1994.

• Douglas S. Bridges and Hajime Ishihara. Complements of intersections in constructive mathematics. Mathematical Logic Quarterly, 40(1):35-43, 1994.

• Douglas S. Bridges and Hajime Ishihara. Erratum: ``Complements of intersections in constructive mathematics''. Mathematical Logic Quarterly, 40(4):570, 1994.

• Douglas Bridges and Hajime Ishihara. Spectra of selfadjoint operators in constructive analysis. Indagationes Mathematicae, 7(1):11-35, 1996.

• Douglas Bridges and Hajime Ishihara. A definite constructive open mapping theorem? Mathematical Logic Quarterly, 44(4):545-552, 1998.

• Douglas Bridges and Hajime Ishihara. Constructive closed range and open mapping theorems. Indagationes Mathematicae, 11(4):509-516, 2001.

• Douglas Bridges and Hajime Ishihara. Constructive unbounded operators. In Peter Schuster, Ulrich Berger, and Horst Osswald, editors, Reuniting the antipodes--constructive and nonstandard views of the continuum (Venice, 1999), volume 306 of Synthese Library, pages 25-37, Dordrecht, 2001. Kluwer Acad. Publ.

• Douglas Bridges and Ayan Mahalanobis. Sequential continuity of functions in constructive analysis. Mathematical Logic Quarterly, 46(1):139-143, 2000.

• Douglas Bridges and Ayan Mahalanobis. Bounded variation implies regulated: a constructive proof. The Journal of Symbolic Logic, 66(4):1695-1700, 2001.

• Douglas Bridges and Ayan Mahalanobis. Increasing, nondecreasing, and virtually continuous functions. Journal of Automata, Languages and Combinatorics, 6(2):139-143, 2001.

• D.S. Bridges and R. Mines. What is constructive mathematics? The Mathematical Intelligencer, 6(4):32-38, 1984.

• Douglas Bridges and Ray Mines. Sequentially continuous linear mappings in constructive analysis. The Journal of Symbolic Logic, 63(2):579-583, 1998.

• Douglas Bridges and Gabriela Popa. Exact, continuous boundary crossings out of convex sets in rⁿ. The Quarterly Journal of Mathematics, 54(4):391-398, 2003.

• Douglas Bridges and Steve Reeves. Constructive mathematics in theory and programming practice. Philosophia Mathematica. Philosophy of Mathematics, its Learning, and its Application. Series III, 7(1):65-104, 1999. Mathematical proof.

• Douglas Bridges and Fred Richman. Varieties of Constructive Mathematics, volume 97 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1987.

• Douglas S. Bridges and Fred Richman. A recursive counterexample to Debreu's theorem on the existence of a utility function. Mathematical Social Sciences, 21(2):179-182, 1991.

• Douglas Bridges and Peter Schuster. A simple constructive proof of Kronecker's density theorem. Elemente der Mathematik, 61:152-154, 2006.

• Douglas Bridges and Karl Svozil. Constructive mathematics and quantum physics. J. Theor. Physics, 39:501-513, 2000.

• Douglas Bridges and Luminita Vîta. Constructing extensions of ultraweakly continuous linear functionals. J. Functional Analysis, 178(2):421-434, 2000.

• Douglas Bridges and Luminita Vîta. Characterising near continuity constructively. Mathematical Logic Quarterly, 47(4):535-538, 2001.

• Douglas Bridges and Luminita Vîta. Cauchy nets in the constructive theory of apartness spaces. Scientiae Mathematicae Japonicae, 56(1):123-132, 2002.

• Douglas Bridges and Luminita Vîta. Apartness spaces as a framework for constructive topology. Annals of Pure and Applied Logic, 119(1-3):61-83, 2003.

• Douglas Bridges and Luminita Vîta. Cauchy nets in uniform apartness spaces. Revue Roumaine de Mathématiques Pures et Appliquées, 48(5-6):467-474, 2003.

• Douglas Bridges and Luminita Vîta. A proof-technique in uniform space theory. The Journal of Symbolic Logic, 68(3):795-802, 2003.

• Douglas Bridges and Luminita Vîta. Separatedness in constructive topology. Documenta Mathematica, 8:567-576, 2003.

• Douglas Bridges and Luminita Vîta. Strong and uniform continuity--the uniform space case. LMS Journal of Computation and Mathematics, 6:326-334, 2003.

• Douglas Bridges and Luminita Vîta. Corrigendum to: ``A proof-technique in uniform space theory''. The Journal of Symbolic Logic, 69(1):328, 2004.

• Douglas Bridges and Luminita Vîta. An extension theorem for ultraweakly continuous linear functionals on b(x,y). In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 77-89. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Douglas Bridges and Luminita Vîta. A general constructive proof technique. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 31-43, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Douglas Bridges and Luminita Vîta. Proximal connectedness. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 91-101. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Douglas Bridges and Luminita Vîta. Pre-apartness structures on spaces of functions. Journal of Complexity, 22(6):881-893, 2006.

• Douglas Bridges and Luminita Vîta. Techniques of Constructive Analysis. Springer, New York, 2006.

• Douglas Bridges and Luminita Vîta. Proximal connectedness. Fundamenta Informaticae, 83(1-2):25-34, 2008.

• Douglas Bridges and Yuchuan Wang. Constructing cutoff functions. New Zealand Journal of Mathematics, 26(1):25-30, 1997.

• Douglas Bridges and Yuchuan Wang. Constructive aspects of the Dirichlet problem. Journal of Universal Computer Science, 3(11):1148-1161 (electronic), 1997. Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science (Auckland, 1997).

• Douglas Bridges and Yuchuan Wang. Constructing best approximations on a Jordan curve. Journal of Approximation Theory, 94(2):222-234, 1998.

• Douglas Bridges and Yuchuan Wang. Constructive weak solutions of the Dirichlet problem. The Journal of the London Mathematical Society. Second Series, 57(3):655-667, 1998.

• Douglas Bridges and Yuchuan Wang. Weak solutions of the Dirichlet problem and the locatedness of H sp 1 sb 0( omega ). New Zealand Journal of Mathematics, 27(1):1-5, 1998.

• Douglas S. Bridges and Nicholas Dudley Ward. Kernels of seminorms in constructive analysis. Theoretical Computer Science, 284(2):259-267, 2002.

• Douglas Bridges, Allan Calder, William Julian, Ray Mines, and Fred Richman. Bounded linear mappings of finite rank. Journal of Functional Analysis, 43(2):143-148, 1981.

• Douglas Bridges, Allan Calder, William Julian, Ray Mines, and Fred Richman. Locating metric complements in Rⁿ. In F. Richman, editor, Constructive Mathematics, volume 873 of Lecture Notes in Mathematics, pages 241-249, 1981. Proc. New Mexico State Univ. Conf., Aug. 11-15, 1980, Las Cruces, NM.

• Douglas Bridges, Allan Calder, William Julian, Ray Mines, and Fred Richman. Picard's theorem. Trans. Amer. Math. Soc., 269(2):513-520, 1982.

• Douglas Bridges, William Julian, and Ray Mines. A constructive treatment of open and unopen mapping theorems. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 35(1):29-43, 1989.

• D. S. Bridges, F. Richman, W. H. Julian, and R. Mines. Extensions and fixed points of contractive maps in r sp n. Journal of Mathematical Analysis and Applications, 165(2):438-456, 1992.

• D.S. Bridges, W.H. Julian, F. Richman, and R. Mines. Extensions and fixed points of contractive maps in Rⁿ. J. Math. Anal. Appl., 165:438-456, 1992.

• Douglas Bridges, Fred Richman, and Wang Yuchuan. Sets, complements and boundaries. Indagationes Mathematicae, 7(4):425-445, 1996.

• D. Bridges, C. Calude, B. Pavlov, and D. Stefanescu. The constructive implicit function theorem and applications in mechanics. Chaos, Solitons and Fractals, 10(6):927-934, 1999.

• Douglas Bridges, Hajime Ishihara, and Peter Schuster. Sequential compactness in constructive analysis. Österr. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. II., 208:159-163, 1999.

• Douglas Bridges, Fred Richman, and Peter Schuster. Adjoints, absolute values, and polar decompositions. J. Operator Theory, 44(2):243-254, 2000.

• Douglas Bridges, Fred Richman, and Peter Schuster. Linear independence without choice. Annals of Pure and Applied Logic, 101(1):95-102, 2000.

• Douglas Bridges, Fred Richman, and Peter Schuster. A weak countable choice principle. Proceedings of the American Mathematical Society, 128(9):2749-2752, 2000.

• Douglas Bridges, Hajime Ishihara, and Peter Schuster. Compactness and continuity, constructively revisited. In Julian Bradfield, editor, Computer science logic, volume 2471 of Lecture Notes in Computer Science, pages 89-102. Springer, 2002.

• Douglas Bridges, Peter Schuster, and Luminita Vîta. Apartness, topology, and uniformity: a constructive view. Mathematical Logic Quarterly, 48(Suppl. 1):16-28, 2002.

• Douglas Bridges, Hajime Ishihara, and Bas Spitters. Locating the range of an operator with an adjoint. Indagationes Mathematicae, 13(4):433-440, 2003.

• Douglas Bridges, Dirk van Dalen, and Hajime Ishihara. Ishihara's proof technique in constructive analysis. Indagationes Mathematicae, 14(2):163-168, 2003.

• Douglas Bridges, Hajime Ishihara, and Luminita Vîta. Computing infima on convex sets, with applications in Hilbert spaces. Proceedings of the American Mathematical Society, 132(9):2723-2732, 2004.

• Douglas Bridges, Ray Mines, Fred Richman, and Peter Schuster. The polydisk Nullstellensatz. Proceedings of the American Mathematical Society, 132(7):2133-2140, 2004.

• Douglas Bridges, Robin Havea, and Peter Schuster. Constructive Banach algebra theory and the Nullstellensatz. Publ. Math. Debrecen, 69(1,2):171-184, 2006.

• Douglas Bridges, Robin Havea, and Peter Schuster. Ideals in constructive Banach algebra theory. Journal of Complexity, 22(6):729-737, 2006.

• Douglas Bridges, Hajime Ishihara, and Luminita Vîta. A new constructive version of Baire's theorem. Hokkaido Math. Journal, 35(1):107-118, 2006.

• Douglas Bridges, Hajime Ishihara, Ray Mines, Fred Richman, Peter M. Schuster, and Luminita Vîta. Almost locatedness in uniform spaces. Czechoslovak Math. J., 57(1):1-12, 2007.

• Douglas S. Bridges. Some notes on continuity in constructive analysis. Bull. London Math. Soc., 8(2):179-182, 1976.

• Douglas S. Bridges. A constructive look at orthonormal bases in Hilbert space. Amer. Math. Monthly, 84(3):189-191, 1977.

• Douglas S. Bridges. The constructive Radon-Nikodym theorem. Pacific J. Math., 70(1):51-65, 1977.

• D. S. Bridges. More on the connectivity of convex sets. Proceedings of the American Mathematical Society, 68(2):214-216, 1978.

• Douglas S. Bridges. A note on Morse's lambda-notation in set theory. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24(2):113-114, 1978.

• Douglas S. Bridges. On continuous mappings between locally compact metric spaces. The Bulletin of the London Mathematical Society, 10(2):201-208, 1978.

• Douglas S. Bridges. On the connectivity of convex sets. The Bulletin of the London Mathematical Society, 10(1):86-90, 1978.

• Douglas S. Bridges. On weak operator compactness of the unit ball of L(H). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24(6):493-494, 1978.

• Douglas S. Bridges. Connectivity properties of metric spaces. Pacific Journal of Mathematics, 80(2):325-331, 1979.

• Douglas S. Bridges. Constructive Functional Analysis. Pitman, London, 1979.

• Douglas S. Bridges. A criterion for compactness in metric spaces? Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25(2):97-98, 1979.

• Douglas S. Bridges. Geometric intuition and elementary constructive analysis. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25(6):521-523, 1979.

• Douglas S. Bridges. On the constructive convergence of series of independent functions. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25(1):93-96, 1979.

• Douglas S. Bridges. A constructive development of Chebyshev approximation theory. Journal of Approximation Theory, 30(2):99-120, 1980.

• Douglas S. Bridges. On the foundations of best-approximation theory. Journal of Approximation Theory, 28(3):273-292, 1980.

• Douglas S. Bridges. A constructive analysis of the Remes algorithm. Journal of Approximation Theory, 32(4):257-270, 1981.

• Douglas S. Bridges. A constructive look at positive linear functionals on l(H). Pacific Journal of Mathematics, 95(1):11-25, 1981.

• Douglas S. Bridges. A constructive proximinality property of finite-dimensional linear subspaces. The Rocky Mountain Journal of Mathematics, 11(4):491-497, 1981.

• Douglas S. Bridges. 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 Mathematics, 97(2):487-488, 1981.

• Douglas S. Bridges. On Montel's proof of the great Picard theorem. The American Mathematical Monthly, 88(1):45-47, 1981.

• Douglas S. Bridges. On the isolation of zeroes of an analytic function. Pacific Journal of Mathematics, 96(1):13-22, 1981.

• Douglas S. Bridges. Towards a constructive foundation for quantum mechanics. In F. Richman, editor, Constructive Mathematics, volume 873 of Lecture Notes in Mathematics, pages 260-273, 1981. Proc. New Mexico State Univ. Conf., Aug. 11-15, 1980, Las Cruces, NM.

• Douglas S. Bridges. Lipschitz constants and moduli of continuity for the Chebyshev projection. Proceedings of the American Mathematical Society, 85(4):557-561, 1982.

• Douglas S. Bridges. Preference and utility: a constructive development. Journal of Mathematical Economics, 9(1-2):165-185, 1982.

• Douglas S. Bridges. Recent progress in constructive approximation theory. In The L. E. J. Brouwer Centenary Symposium (Noordwijkerhout, 1981), pages 41-50. North-Holland, Amsterdam, 1982.

• Douglas S. Bridges. Numerical representation of intransitive preferences on a countable set. Journal of Economic Theory, 30(1):213-217, 1983.

• Douglas S. Bridges. A numerical representation of preferences with intransitive indifference. Journal of Mathematical Economics, 11(1):25-42, 1983.

• Douglas S. Bridges. Operator ranges, integrable sets, and the functional calculus. Houston Journal of Mathematics, 11(1):31-44, 1985.

• Douglas S. Bridges. Representing interval orders by a single real-valued function. Journal of Economic Theory, 36(1):149-155, 1985.

• Douglas S. Bridges. Numerical representation of interval orders on a topological space. Journal of Economic Theory, 38(1):160-166, 1986.

• Douglas S. Bridges. A constructive Morse theory of sets. In Mathematical logic and its applications (Druzhba, 1986), pages 61-79. Plenum, New York, 1987.

• Douglas S. Bridges. The Euclidean distance construction of order homomorphisms. Mathematical Social Sciences, 15(2):179-188, 1988.

• Douglas S. Bridges. Locatedness, convexity, and lebesque measurability. Quart. J. Math. Oxford Ser. 2, 39:411-421, 1988.

• Douglas S. Bridges. Approximate interpolation by functions in a Haar space. Journal of Approximation Theory, 57(1):35-39, 1989.

• Douglas S. Bridges. The constructive theory of preference relations on a locally compact space. Indagationes Mathematicae, 51(2):141-165, 1989.

• Douglas S. Bridges. A general constructive intermediate value theorem. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 35:433-435, 1989.

• Douglas S. Bridges. Order isomorphisms--a constructive measure-theoretic view. In Mathematical logic, pages 243-255. Plenum, New York, 1990.

• Douglas S. Bridges. Preference, indifference, and Markov's principle. Mathematical Social Sciences, 20(2):131-145, 1990.

• Douglas S. Bridges. The constructive inequivalence of various notions of preference ordering. Mathematical Social Sciences, 21(2):169-176, 1991.

• Douglas S. Bridges. Constructive notions of strict convexity. Mathematical Logic Quarterly, 39(3):295-300, 1993.

• Douglas S. Bridges. Sequential, pointwise, and uniform continuity: a constructive note. Mathematical Logic Quarterly, 39(1):55-61, 1993.

• Douglas S. Bridges. A constructive look at the real number line. In Real numbers, generalizations of the reals, and theories of continua, pages 29-92. Kluwer Acad. Publ., Dordrecht, 1994.

• Douglas S. Bridges. The constructive theory of preference relations on a locally compact space. II. Mathematical Social Sciences, 27(1):1-9, 1994.

• Douglas S. Bridges. Constructive mathematics and unbounded operations. J. Philos. Logic, 24(5):549-561, 1995.

• Douglas S. Bridges. Bishop's principle. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 17-20. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Douglas S. Bridges. Constructive truth in practice. In Truth in mathematics (Mussomeli, 1995), pages 53-69. Oxford Univ. Press, New York, 1998.

• Douglas S. Bridges. Can constructive mathematics be applied in physics? Journal of Philosophical Logic, 28(5):439-453, 1999.

• Douglas S. Bridges. Constructive mathematics: a foundation for computable analysis. Theoretical Computer Science, 219:95-109, 1999.

• Douglas S. Bridges. Constructive methods in mathematical economics. In Gerhard Herden, Norbert Knoche, Christian Seidl, and Walter Trockel, editors, Mathematical utility theory (Essen, 1997), volume Supp. 8 of Journal of Economy, pages 1-21. Springer, Vienna, 1999.

• Douglas Bridges. A constructive look at functions of bounded variation. Bull. London Math. Soc., 32(3):316-324, 2000.

• Douglas Bridges. Constructive methods in Banach algebra theory. Mathematica Japonica, 52(1):145-161, 2000.

• Douglas Bridges. Converses of Bishop's lemma on located sets. Indagationes Mathematicae, 11(1):31-38, 2000.

• Douglas Bridges. Dini's theorem: A constructive case study. In C.S. Calude, M.J. Dinneen, and S. Sburlan, editors, Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, pages 69-80, London, 2001. Springer. Proceedings of DMTCS 2001.

• Douglas Bridges. Prime and maximal ideals in constructive ring theory. Communications in Algebra, 29(7):2787-2803, 2001.

• Douglas Bridges. Reality and virtual reality in mathematics. Bulletin of the European Association for Theoretical Computer Science, 78:221-230, 2002.

• Douglas S. Bridges. First steps in constructive game theory. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 3-9. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Douglas S. Bridges. Constructive complements of unions of two closed sets. Mathematical Logic Quarterly, 50(3):293-294, 2004.

• Douglas S. Bridges. Constructivity in mathematics. Cubo, 6(1):209-258, 2004.

• Douglas S. Bridges. First steps in constructive game theory. Mathematical Logic Quarterly, 50(4,5):501-506, 2004.

• Douglas S. Bridges. Church's thesis and Bishop's constructivism. In Adam Olszewski, editor, Church's Thesis After 70 Years, pages 58-65. Ontos, Berlin, 2006.

• Douglas S. Bridges. Colocatedness and Lebesgue integrability. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 98-104, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Douglas S. Bridges. Constructing local optima on a compact interval. Archive for Mathematical Logic, 46:149-154, 2007.

• Douglas S. Bridges. Philosophy of mathematics: 5 questions. In Vincent F. Hendricks and Hannes Leitgeb, editors, Philosophy of mathematics: 5 questions, pages 45-49. Automatic Press/VIP, New York, London, 2007.

• Douglas S. Bridges. Product a-frames and proximity. Mathematical Logic Quarterly, 54(1):12-25, 2008.

• Douglas S. Bridges. Uniform continuity properties of preference relations. Notre Dame Journal of Formal Logic, 49(1):97-106, 2008.

• L.E.J. Brouwer. Intuitionistischer Beweis des Jordanschen Kurvensatzes. Koninklijke Nederl. Akad. Wentensch, Proc., 28:503-508, 1925. translated in: A. Heyting (ed.), Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, North-Holland, Amsterdam, 1975, 315-320.

• L.E.J. Brouwer. An intuitionist correction of the fixed-point theorem on the sphere. Proc. Roy. Soc. London, Ser. A, 213:1-2, 1952.

• L.E.J. Brouwer. Points and spaces. Canad. Journ. Math., 6:1-17, 1954.

• L.E.J. Brouwer. Collected Works, Vol. 1, Philosophy and Foundations of Mathematics. North-Holland, Amsterdam, 1975. Heyting, A. (ed).

• L.E.J. Brouwer. Fixed cores which cannot be found, though they are claimed to exist by classical theorems. In A. Heyting, editor, Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, pages 516-518, Amsterdam, 1975. North-Holland.

• L.E.J. Brouwer. The unreliability of logical principles. In A. Heyting, editor, Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, pages 107-111, Amsterdam, 1975. North-Holland.

• L.E.J. Brouwer. Collected Works, Vol. 2, Geometry, Analysis, Topology and Mechanics. North-Holland, Amsterdam, 1976. Freudenthal, H. (ed).

• L.E.J. Brouwer. Brouwer's Cambridge Lectures on Intuitionism. Cambridge Univ. Press, 1981. van Dalen, D. (ed).

• Alberto Ciaffaglione and Pietro Di Gianantonio. A tour with constructive real numbers. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Types for Proofs and Programs, volume 2277 of LNCS, pages 41-52, Berlin, 2002. Springer. International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000.

• Gabriel Ciobanu and Danu c t Rusu. Supermetrics over apartness lattice-ordered semigroup. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 191-200. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Thierry Coquand. Formal topology and constructive mathematics: the Gelfand and Stone-Yosida representation theorems. Journal of Universal Computer Science, 11(12):1932-1944, 2005.

• Giovanni Curi. Constructive metrisability in point-free topology. Theoretical Computer Science, 305:85-109, 2003.

• H. de Swart. Elements of intuitionistic analysis II the Stone-Weierstrass theorem and Ascoli's theorem. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22(1):501-508, 1976.

• H. de Swart. Elements of intuitionistic analysis. Rolle's theorem and complete, totally bounded, metric spaces. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22(1):289-298, 1976.

• Luminita Dediu and Douglas Bridges. Constructive notes on uniform and locally convex spaces. In G. Ciobanu and G. Pun, editors, Fundamentals of computation theory, volume 1684 of Lecture Notes in Computer Science, pages 195-203. Springer, Berlin, 1999. 12th International Symposium, FCT'99, Iasi, Romania, August/September 1999.

• Hannes Diener and Iris Loeb. Sequences of real functions on [0,1] in constructive reverse mathematics. Annals of Pure and Applied Logic, 157(1):1-62, 2009.

• M. Dummett. The Philosophical Basis of Intuitionistic Logic. In H.E. Rose and J.C. Shepherdson, editors, Logic Colloquium '73, volume 80 of Stud. Logic. Found. Math., pages 5-40, 1975. (Bristol 1973).

• M. Dummett. Elements of Intuitionism. Oxford Univ. Press, 1977.

• S. Feferman. Systems of predicative analysis. The Journal of Symbolic Logic, 29:1-30, 1964.

• S. Feferman. Theories of finite type related to mathematical practice. In J. Barwise, editor, Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, pages 913-971, Amsterdam, 1977. North-Holland.

• S. Feferman. Constructive theories of functions and classes. In van Dalen Boffa, D. and K. McAloon, editors, Proceedings Logic Colloquium '78, volume 97 of Studies in Logic and the Foundations of Mathematics, pages 159-224, Amsterdam, 1979. North-Holland. Mons, Aug. 24-Sept. 1., 1978.

• S. Feferman. Between constructive and classical mathematics. In M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, and W. Thomas, editors, Computation and Proof Theory, volume 1104 of Lecture Notes in Mathematics, pages 143-162, 1984. (Proc. Logic Colloq., Aachen, July 14-23, 1983, Part II).

• H.M. Friedman. Set theoretic foundations for constructive analysis. Ann. of Math., 105:1-28, 1977.

• D. Gaier. Konstruktive Methoden der konformen Abbildung, Tracts in Natural Philosophy, volume 3. Springer, Berlin, 1964.

• Nicola Gambino and Peter Schuster. Spatiality for formal topologies. Mathematical Structures in Computer Science, 17:65-80, 2007.

• Philipp Gerhardy and Ulrich Kohlenbach. Strongly uniform bounds from semi-constructive proofs. Annals of Pure and Applied Logic, 141(1-2):89-107, 2006.

• Herman Geuvers, Milad Niqui, Bas Spitters, and Freek Wiedijk. Constructive analysis, types and exact real numbers. Mathematical Structures in Computer Science, 17:3-36, 2007.

• V.I. Glivenko. Sur la logique de M. Brouwer. Roy. Belg. Bull. Cl. Sci., 14:225-228, 1928.

• V.I. Glivenko. Sur quelques points de la logique de M. Brouwer. Roy. Belg. Bull. Cl. Sci., 15:183-188, 1929.

• N.D. Goodman and J. Myhill. The formalization of Bishop's constructive mathematics. In F. W. Lawvere, editor, Toposes, Algebraic Geometry and Logic, volume 274 of Lecture Notes in Mathematics, pages 83-96, 1972. (Partial Report Conf. Connections between Category Theory, Algebraic Geometry and Intuitionistic Logic, Dalhousie Univ., Halifax, Nova Scotia, Jan. 16-19, 1971).

• Robin Siale Havea. Constructive Spectral and Numerical Range Theory. PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2001.

• Robin Siale Havea. On firmness of the state space and positive elements of a Banach algebra. Journal of Universal Computer Science, 11(12):1963-1969, 2005.

• A. Heyting. Note on the Riesz-Fischer theorem. Indagationes Mathematicae, 13:35-40, 1951.

• A. Heyting. Intuitionism, An Introduction. North-Holland, Amsterdam, 1956. [2nd. rev. edn., 1966].

• J.M.E. Hyland. Application of constructivity. In L.J. Cohen, G. Los, H. Pfeiffer, , and K.-P. Podewski, editors, Methodology and Philos. Sci. VI, volume 104 of Studies in Logic and the Foundations of Mathematics, pages 145-152, Amsterdam, 1982. North-Holland. (Proc. 6th. Internatl. Congr. Logic, Methodology, and Philos. Sci., Hannover, Aug. 22-29, 1979).

• Hajime Ishihara and Erik Palmgren. Quotient topologies in constructive set theory and type theory. Annals of Pure and Applied Logic, 141(1-2):257-265, 2006.

• Hajime Ishihara and Peter Schuster. Compactness under constructive scrutiny. Mathematical Logic Quarterly, 50(6):540-550, 2004.

• Hajime Ishihara, Ray Mines, Peter Schuster, and Luminita Vîta. Quasi-apartness and neighbourhood spaces. Annals of Pure and Applied Logic, 141(1-2):296-306, 2006.

• Hajime Ishihara. Constructive reflexivity of a uniformly convex Banach space. Proc. Amer. Math. Soc., 104(3):735-740, 1988.

• Hajime Ishihara. Constructive compact linear mappings. Bull. London Math. Soc., 21:577-584, 1989.

• Hajime Ishihara. On the constructive Hahn-Banach theorem. Bull. London Math. Soc., 21(1):79-81, 1989.

• Hajime Ishihara. Boundedness, normability and compactness of constructive linear mappings. Dissertation, Tokyo Institute of Technology, Tokyo, mar 1990.

• Hajime Ishihara. An omniscience principle, the König lemma and the Hahn-Banach theorem. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 36:237-240, 1990.

• Hajime Ishihara. Constructive compact operators on a Hilbert space. Annals of Pure and Applied Logic, 52:31-37, 1991.

• Hajime Ishihara. Continuity and nondiscontinuity in constructive mathematics. The Journal of Symbolic Logic, 56(4):1349-1354, 1991.

• Hajime Ishihara. Constructive existence of Minkowski functionals. Proc. Amer. Math. Soc., 116(1):79-84, 1992.

• Hajime Ishihara. Continuity properties in constructive mathematics. The Journal of Symbolic Logic, 57(2):557-565, 1992.

• Hajime Ishihara. Markov's principle, Church's thesis and Lindelöf's theorem. Indagations Math., 4:321-325, 1993.

• Hajime Ishihara. A constructive version of Banach's inverse mapping theorem. New Zealand J. Math., 23:71-75, 1994.

• Hajime Ishihara. Sequential continuity of linear mappings in constructive mathematics. Journal of Universal Computer Science, 3:1250-1254, 1997.

• Hajime Ishihara. Feasibly constructive analysis. Surikaisekikenkyusho Kokyuroku, 1169:76-83, 2000. Research Institute for Mathematical Sciences Kyoto.

• Hajime Ishihara. Locating subsets of a hilbert space. Proc. Amer. Math. Soc., 129:1385-1390, 2001.

• Hajime Ishihara. Sequentially continuity in constructive mathematics. In C.S. Calude, M.J. Dinneen, and S. Sburlan, editors, Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, pages 5-12, London, 2001. Springer. Proceedings of DMTCS 2001.

• Hajime Ishihara. Constructive reverse mathematics: compactness properties. In Laura Crosilla and Peter Schuster, editors, From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics, pages 245-267. Oxford University Press, 2005.

• Hajime Ishihara. Unique existence and computability in constructive reverse mathematics. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 368-377, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• S.C. Kleene and R. Vesli. The foundations of intuitionistic mathematics. Especially in relation to recursive functions. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1965.

• Andrei N. Kolmogorov. On the principle of tertium non datur (Russian). Mat. Sb., 32:646-667, 1925. [translated in: From Frege to Gödel: A Source Book in Logic, 1879-1931, J. van Heijenroot, (ed.), (Harvard Univ. Press, Cambridge, Mass. and Oxford Univ. Press, London, 1967) 414-437].

• G. Kreisel and A. Macintyre. Constructive logic versus algebraization, I. In A.S. Troelstra and D. van Dalen, editors, The L. E. J. Brouwer Centenary Sympos., volume 110 of Studies in Logic and the Foundations of Mathematics, pages 217-260, Amsterdam, 1982. North-Holland. (Noordwijkerhout, June 8-13, 1981).

• G. Kreisel and H. Putnam. Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül. Arch. Math. Logic Grundlag, 3:74-78, 1957.

• G. Kreisel and A.S. Troelstra. Formal systems for some branches of intuitionistic analysis. Ann. Math. Logic, 1:229-387, 1970.

• G. Kreisel. Interpretation of analysis by means of constructive functionals of finite types. In A. Heyting, editor, Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, pages 101-128, Amsterdam, 1959. North-Holland. Proc. Colloq., Amsterdam, Aug. 26-31, 1957.

• G. Kreisel. Foundations of Intuitionistic Logic, Methodology and Philisophy of Science. In Logic, Methodology, and Philosophy of Science, pages 198-210, 1962. (Proc. Internatl. Congr., Stanford, CA, 1960).

• G. Kreisel. Church's thesis: A kind of reducibility axiom for constructive mathematics. In A. Kino, J. Myhill, and R.E. Vesley, editors, Intuitionism and Proof Theory, Studies in Logic and the Foundations of Mathematics, pages 121-150, Amsterdam, 1970. North-Holland. (Proc. Conf., Buffalo, N.Y., 1968).

• G. Kreisel. Perspectives in the philosophy of pure mathematics. In P. Suppes, L. Henkin, A. Joja, and Gr.C. Moisil, editors, Logic, Methodology, and Philosophy of Science VI, Studies in Logic and the Foundations of Mathematics, pages 255-277, Amsterdam, 1973. North-Holland. (Proc. 4th. Internatl. Congr. Logic, Methodology and Philos. Sci., Bucharest, Aug. 29-Sept. 4,1971).

• G. Kreisel. Mathematical logic: tool and object lesson for science. The present state of the problem of foundations of mathematics, florence, 1981. Synthese Lib., 62:139-151, 1985.

• Boris Abramovich Kusner. The centenary of A.A. Markov, jr.; His personality, his constructive mathematics. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 55-79. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Davorin Lesnik. Constructive Urysohn’s universal metric space. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 171-179. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

• Vladimir Lifschitz. Constructive assertions in an extension of classical mathematics. The Journal of Symbolic Logic, 47(2):359-387, 1982.

• Paul Lorenzen. Mass und Integral in der konstruktiven Analysis. Mathematische Zeitschrift, 54:275-290, 1951.

• Paul Lorenzen. Differential und Integral. Eine konstruktive Einführung in die klassische Analysis. Akademische Verlagsgesellschaft, Frankfurt, 1965.

• Paul Lorenzen. Konstruktive Analysis und das geometrische Kontinuum. Dialectica, 32:221-227, 1978.

• Horst Luckhardt. A fundamental effect in computations on real numbers. Theoretical Computer Science, 5(3):321-324, 1977.

• Mark Mandelkern. Connectivity of an interval. Proceedings of the American Mathematical Society, 54:170-172, 1976.

• Mark Mandelkern. Continuity of monotone functions. Pacific Journal of Mathematics, 99:413-418, 1982.

• Mark Mandelkern. Constructive continuity, volume 42 of Memoirs. American Mathematical Society, Providence, 1983.

• Mark Mandelkern. Constructively complete finite sets. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 34(2):97-103, 1988.

• Maurice Margenstern. On a variant of constructivisation of the theory of almost periodic functions. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24(6):495-507, 1978.

• Per Martin-Löf. Notes on constructive mathematics. Almqvist and Wiksell, Stockholm, 1970.

• J.R. Moschovakis. A classical view of the intuitionistic continuum. Annals of Pure and Applied Logic, 81:9-24, 1996.

• J.A. Nuber. A constructive ergodic theorem. Trans. Amer. Math. Soc., 164:115-137, 1972.

• J.A. Nuber. Erratum to: ``A constructive ergodic theorem''. Trans. Amer. Math. Soc., 216:393, 1976.

• Gabriela Popa. A theoretical constructivisation of mathematical economics. PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2003.

• Fred Richman and Douglas Bridges. A constructive proof of Gleason's theorem. Journal of Functional Analysis, 162(2):287-312, 1999.

• Fred Richman, Douglas Bridges, Allan Calder, William Julian, and Ray Mines. Compactly generated Banach spaces. Archiv der Mathematik. Archives of Mathematics. Archives Mathématiques, 36(3):239-243, 1981.

• Fred Richman, Douglas Bridges, and Peter Schuster. Trace-class operators. Houston Journal of Mathematics, 28(3):565-583, 2002.

• Fred Richman. Polynomials and linear transformations. Linear Algebra and its Applications, 131(1):131-137, 1990.

• Fred Richman. Omniscience principles and functions of bounded variation. Mathematical Logic Quarterly, 48(1):111-116, 2002.

• M. Rosenblatt, editor. Errett Bishop: Reflections on him and his research, volume 39 of Contemp. Math., Providence, 1985. Amer. Math. Soc.

• Paul C. Rosenbloom. An elementary constructive proof of the fundamental theorem of algebra. American Mathematical Monthly, 52(10):562-570, 1945.

• David A. Ross. A nonstandard proof of a lemma from constructive measure theory. Mathematical Logic Quarterly, 52(5):494-497, 2006.

• Giovanni Sambin. Some points in formal topology. Theoretical Computer Science, 305:347-408, 2003.

• Giovanni Sambin. Doing without Turing machines: Constructivism and formal topology. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 674-675, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• A. Scedrov. Differential equations in constructive analysis and in the recursive realizability topos. J. Pure Appl. Algebra, 33:69-80, 1984.

• A. Scedrov. Diagonalization of continuous matrices as a representation of intuitionistic reals. Annals of Pure and Applied Logic, 30:201-206, 1986.

• Peter Schuster, Ulrich Berger, and Horst Osswald, editors. Reuniting the Antipodes - Constructive and Nonstandard Views of the Continuum, volume 306 of Synthese Library, Dordrecht, 2001. Kluwer Academic Publishers. Proceedings of the symposium held in Venice, May 16-22, 1999.

• Peter Schuster, Luminita Vîta, and Douglas Bridges. Apartness as a relation between subsets. In C.S. Calude, M.J. Dinneen, and S. Sburlan, editors, Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, pages 203-214, London, 2001. Springer. Proceedings of DMTCS 2001.

• Peter Schuster, Luminita Vîta, and Douglas Bridges. Strong versus uniform continuity: a constructive round. Quaestiones Mathematicae, 26(2):171-190, 2003.

• Peter Schuster. A constructive look at generalized Cauchy reals. Mathematical Logic Quarterly, 46(1):125-134, 2000.

• Peter Schuster. Elementary choiceless constructive analysis. In Peter G. Clote and Helmut Schwichtenberg, editors, Computer Science Logic, volume 1862 of Lecture Notes in Computer Science, pages 512-526, Berlin, 2000. Springer. 14th International Workshop, CSL 2000, Fischbachau, Germany, August 21-26, 2000.

• Peter M. Schuster. Unique existence, approximate solutions, and countable choice. Theoretical Computer Science, 305:433-455, 2003.

• Peter Schuster. What is continuity, constructively? Journal of Universal Computer Science, 11(12):2076-2085, 2005.

• Peter Schuster. Unique solutions. Mathematical Logic Quarterly, 52(6):534-539, 2006.

• Peter Schuster. Problems as solutions. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 676-684, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

• Helmut Schwichtenberg. A direct proof of the equivalence between Brouwer's fan theorem and König's lemma with a uniqueness hypothesis. Journal of Universal Computer Science, 11(12):2086-2095, 2005.

• Helmut Schwichtenberg. Inverting monotone continuous functions in constructive analysis. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 490-504, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.

• Bas Spitters and Wim Veldman. A constructive converse of the mean value theorem. Indagationes Mathematicae, New Series, 11(1):151-157, 2000.

• Bas Spitters. Constructive and intuitionistic integration theory and functional analysis. PhD thesis, University of Nijmegen, 2002.

• Bas Spitters. Located operators. Mathematical Logic Quarterly, 48(Suppl. 1):107-122, 2002.

• Bas Spitters. Constructive results on operator algebras. Journal of Universal Computer Science, 11(12):2096-2113, 2005.

• Bas Spitters. A constructive view on ergodic theorems. The Journal of Symbolic Logic, 71(2):611-623, 2006.

• J. Todd. Introduction to the Constructive Theory of Functions. Academic Press, New York, 1963.

• A.S. Troelstra and D. van Dalen. Constructivism in Mathematics, Volume 1, volume 121 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1988.

• A.S. Troelstra and D. van Dalen. Constructivism in Mathematics, Volume 2, volume 123 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1988.

• A.S. Troelstra. Intuitionistic continuity. Nieuw Arch. Wisk., 15:2-6, 1967.

• A.S. Troelstra. Models and computability. In A.S. Troelstra, editor, Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics, pages 97-174, 1973.

• A.S. (ed.) Troelstra, editor. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer, Berlin, 1973.

• A.S. Troelstra. A note on non-extensional operations in connection with continuity and recursivness. Nederl. Akad. Wetensch. Proc. Ser. A, 39:455-462, 1977.

• A.S. Troelstra. Intuitionistic extensions of the reals. Nieuw Arch. Wisk., 28:63-113, 1980.

• A.S. Troelstra. Intuitionistic extensions of the reals, II. In Logic Colloq. '80, volume 108 of Studies in Logic and the Foundations of Mathematics, Amsterdam, 1980. North-Holland. Prague, 1980.

• A.S. Troelstra. An intuitionistic look at the real numbers (Dutch). In Summer course 1993: the real numbers, CWI Syllabi, volume 35, pages 67-81, 1993. Math. Centrum, 1993.

• Dirk van Dalen. Lectures on intuitionism. In A. R. D. Mathais and H. Rogers, editors, Cambridge Summer School in Mathematical Logic, Lecture Notes in Mathematics, pages 1-94, 1973. Aug. 1-21, 1971.

• D. van Dalen. An interpretation of intuitionistic analysis. Ann. Math. Logic, 13:1-43, 1978. with an appendix by Troelstra, A.S.

• Dirk van Dalen. How the mathematical objects determine the mathematical principles. Journal of Universal Computer Science, 11(12):2132-2141, 2005.

• W. Veldman. Investigations in Intuitionistic Hierarchy Theory. Ph.d. thesis, Katholieke Universiteit, Nijmegen, Nijmegen, The Netherlands, 1981.

• R.E. Vesley. Choice sequences and Markov's principle. Compositio Mathematica, 24:33-53, 1972.

• Luminita S. Vîta and Douglas S. Bridges. A constructive theory of point-set nearness. Theoretical Computer Science, 305:473-489, 2003.

• Luminita Vîta and Douglas Bridges. More on Cauchy nets in apartness spaces. Scientiae Mathematicae Japonicae, 59(3):547-552, 2004.

• Luminita Simona Vîta. A Constructive Development of Operator Algebra Theory. PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2000.

• Luminita Simona Vîta. On complements of sets and the Efremovic condition in pre-apartness spaces. Journal of Universal Computer Science, 11(12):2159-2164, 2005.

• Frank Waaldijk. Modern Intuitionistic Topology. PhD thesis, Radboud University Nijmegen, 1996.

• Frank Waaldijk. On the foundations of constructive mathematics - especially in relation to the theory of continuous functions. Foundations of Science, 10(3):249-324, 2005.

• H. Weyl. Das Kontinuum. Veit, Leipzig, 1978.

• Takeshi Yamakawa and Vladik Kreinovich. Why fundamental physical equations are of second order? International Journal of Theoretical Physics, 38(6):1763-1770, 1999.

• Feng Ye. Toward a constructive theory of unbounded linear operators. The Journal of Symbolic Logic, 65(1):357-370, 2000.

• Satoru Yoshida. The constructive completion of the space cal d(r). Mathematical Logic Quarterly, 51(1):77-82, 2005.

• Satoru Yoshida. Generalized functions with pseudobounded support in constructive mathematics. Journal of Complexity, 22(6):783-802, 2006.

• Wang Yuchuan. Constructive Analysis of Partial Differential Equations. PhD thesis, Department of Mathematics, University of Waikato, Hamilton, 1997.

• Peter Zahn. Ein konstruktiver Weg zur Maßtheorie und Funktionalanalysis. Wissenschaftliche Buchgesellschaft, Darmstadt, 1978.

• Peter Zahn. Gilt das Lemma von König ``konstruktiv''? Archiv für Mathematische Logik und Grundlagenforschung, 25:33-35, 1985.

Russian Constructive Analysis

• Douglas Bridges and Osvald Demuth. On the Lebesgue measurability of continuous functions in constructive analysis. BAMS, 24(2):259-276, 1991.

• G.S. Ceitin and I.D. Zaslavskii. Singular coverings and properties of constructive functions connected with them. Tr. Mat. Inst. Steklov, 67:458-502, 1962. (Russian).

• G.S. Ceitin and I.D. Zaslavskii. A criterion of the rectifiability of constructive plane curves. Izv. Akad Nauk Armjan. SSR Ser. Mat., 5:434-440, 1970. (Russian).

• G.S. Ceitin and I.D. Zaslavskii. Yet another constructive variant of the Cauchy theorem. Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI), 20:36-39,282-283, 1971. (Russian).

• G.S. Ceitin, Zaslavskii, and Sanin N.A. Peculiarities of constructive mathematical analysis. In Proc. Internat. Congr. Math., pages 253-261, Moscow, 1968. Mir. (Moscow, 1966, in Russian).

• G.S. Ceitin. On a theorem of Cauchy in constructive analysis. Uspehi Mat. Nauk, 10:207-209, 1955. (in Russian).

• G.S. Ceitin. Uniform recursiveness of algorithmic operators on general recursive functions and a canonical representation for constructive functions of a real argument. In Proc. Third All-Union Math. Congr., Moscow 1956, volume 1, pages 188-189, Moscow, 1956. Izdat. Akad. Nauk SSSR. (in Russian).

• G.S. Ceitin. Algorithmic operators in constructive complete separable metric spaces. Doklady Akademii Nauk, 128:49-52, 1959. (in Russian).

• G.S. Ceitin. Algorithmic operators in constructive metric spaces. Tr. Mat. Inst. Steklov, 67:295-361, 1962. (in Russian, English trans. in AMS Trans. 64, 1967).

• G.S. Ceitin. Mean value theorems in constructive analysis. Tr. Mat. Inst. Steklov, 67:362-384, 1962. (in Russian, English trans. in AMS Trans. 98, 1971).

• G.S. Ceitin. Three theorems on constructive functions. Tr. Mat. Inst. Steklov, 72:537-543, 1964. (in Russian, English trans. in AMS Trans. 100, 1972).

• G.S. Ceitin. On upper bounds of recursively enumerable sets of constructive real numbers. Tr. Mat. Inst. Steklov, 113:102-172, 1970. (in Russian).

• Osvald Demuth and Pavel Filipec. Differentiation of constructive functions of a real variable and relative computability. In D.G. Skordev, editor, Mathematical Logic and Its Applications, pages 81-106, New York, 1987. Plenum Press. Proceedings of an advanced international summer school and conference in honor of the 80th anniversary of Kurt Gödel's birth, held September 24-October 4, 1986 in Druzhba, Bulgaria.

• Osvald Demuth and V. Kmínek. Properties of indefinite constructive Lebesgue-Stieltjes integrals (Russian). Commentationes Mathematicae Universitatis Carolinae, 21(4):629-644, 1980.

• Osvald Demuth and A. Kucera. Remarks on constructive mathematical analysis. In Logic Colloquium '78 (Mons, 1978), pages 81-129. North-Holland, Amsterdam, 1979.

• Osvald Demuth and A. Kucera. Remarks on 1-genericity, semigenericity and related concepts. Commentationes Mathematicae Universitatis Carolinae, 28(1):85-94, 1987.

• Osvald Demuth and L. Nemeckova. The constructive analogue of the property (T sb 1) (Russian). Comment. Math. Univ. Carolinae, 14:421-439, 1973.

• Osvald Demuth and L. Nemecková. The constructive analogues of the properties (N) and (S) (Russian). Comment. Math. Univ. Carolinae, 14:565-582, 1973.

• Osvald Demuth and I. Polivka. The representation of linear functionals in the space of codes of constructive functions that are uniformly continuous on the segment 0 triangle 1 (Russian). Commentationes Mathematicae Universitatis Carolinae, 20(4):765-780, 1979.

• Osvald Demuth, R. Kryl, and A. Kucera. The use of the theory of functions that are partial recursive relative to numerical sets in constructive mathematics (Russian). Acta Universitatis Carolinae. Mathematica et Physica, 19(1):15-60, 1978.

• Osvald Demuth. On Lebesgue integration in constructive analysis (Russian). Dokl. Akad. Nauk SSSR, 160:1239-1241, 1965.

• Osvald Demuth. The Lebesgue integral in constructive analysis (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 4:30-43, 1967. [translation in: A.O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic, Part II, Consultants Bureau, New York, 1970].

• Osvald Demuth. A necessary and sufficient condition for the Riemann integrability of constructive functions. Dokl. Akad. Nauk SSSR, 176:757-758, 1967.

• Osvald Demuth. The connection between Riemann and Lebesgue integrability of constructive functions (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 8:29-31, 1968. [translation in: A.O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic, Part II, Consultants Bureau, New York, 1970].

• Osvald Demuth. Fubini's theorem for the Riemann integral in constructive mathematics. (Russian). Comment. Math. Univ. Carolinae, 9:677-686, 1968.

• Osvald Demuth. The Lebesgue integral and the concept of measurability of functions in constructive analysis (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 8:21-28, 1968. [translation in: A.O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic, Part II, Consultants Bureau, New York, 1970].

• Osvald Demuth. The differentiability of constructive functions (Russian). Comment. Math. Univ. Carolinae, 10:167-175, 1969.

• Osvald Demuth. The Lebesgue measurability of sets in constructive mathematic (Russian). Comment. Math. Univ. Carolinae, 10:463-492, 1969.

• Osvald Demuth. Linear functionals in the constructive spaces L sb r (Russian). Comment. Math. Univ. Carolinae, 10:357-390, 1969.

• Osvald Demuth. Note on the paper: ``Fubini's theorem for the Riemann integral in constructive mathematics'' (Russian). Comment. Math. Univ. Carolinae, 10:115-120, 1969.

• Osvald Demuth. The spaces L sb n and S in constructive mathematics (Russian). Comment. Math. Univ. Carolinae, 10:261-284, 1969.

• Osvald Demuth. The integrability of derivatives of constructive functions (Russian). Comment. Math. Univ. Carolinae, 11:667-691, 1970.

• Osvald Demuth. Mean value theorems for the constructive Lebesgue integral (Russian). Comment. Math. Univ. Carolinae, 11:249-269, 1970.

• Osvald Demuth. Necessary and sufficient conditions for the absolute continuity of constructive functions (Russian). Comment. Math. Univ. Carolinae, 11:705-726, 1970.

• Osvald Demuth. The representability of constructive functions of weakly bounded variation (Russian). Comment. Math. Univ. Carolinae, 11:421-434, 1970.

• Osvald Demuth. The representability of constructive functions of weakly bounded variation (Russian). Comment. Math. Univ. Carolinae, 11:421-434, 1970.

• Osvald Demuth. A certain condition for the differentiability of constructive functions of bounded variation (Russian). Comment. Math. Univ. Carolinae, 12:687-711, 1971.

• Osvald Demuth. 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. Carolinae, 12:587-610, 1971.

• Osvald Demuth. The superpositions of absolutely continuous constructive functions (Russian). Comment. Math. Univ. Carolinae, 12:423-451, 1971.

• Osvald Demuth. 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. Carolinae, 13:227-251, 1972.

• Osvald Demuth. 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. Carolinae, 13:265-282, 1972.

• Osvald Demuth. The constructive analogue of the connection between the Lebesgue measurability of sets and of functions (Russian). Comment. Math. Univ. Carolinae, 14:377-396, 1973.

• Osvald Demuth. The representability of uniformly continuous constructive functions (Russian). Comment. Math. Univ. Carolinae, 14:7-25, 1973.

• Osvald Demuth. 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. Carolinae, 15:195-210, 1974.

• Osvald Demuth. The representability of constructive functions possessing the properties ( rm s) and ( rm t sb 1) in the form of superpositions (Russian). Comment. Math. Univ. Carolinae, 15:49-64, 1974.

• Osvald Demuth. Constructive pseudonumbers (Russian). Comment. Math. Univ. Carolinae, 16:315-331, 1975.

• Osvald Demuth. The differentiability of constructive functions of weakly bounded variation on pseudo numbers (Russian). Comment. Math. Univ. Carolinae, 16(3):583-599, 1975.

• Osvald Demuth. The constructive analogue of the Denjoy-Young theorem on derived numbers (Russian). Comment. Math. Univ. Carolinae, 17(1):111-126, 1976.

• Osvald Demuth. The domains of definition of effective operators over general recursive functions and of constructive functions of a real variable (Russian). Comment. Math. Univ. Carolinae, 17(4):633-646, 1976.

• Osvald Demuth. A constructive analogue of the functions of the nth Baire class (Russian). Comment. Math. Univ. Carolinae, 18(2):231-245, 1977.

• Osvald Demuth. A generalization of the constructive Lebesgue integral (Russian). Comment. Math. Univ. Carolinae, 18(3):499-514, 1977.

• Osvald Demuth. Constructive analogues of generalized absolutely continuous functions of generalized bounded variation (Russian). Commentationes Mathematicae Universitatis Carolinae, 19(3):471-487, 1978.

• Osvald Demuth. The pseudodifferentiability of uniformly continuous constructive functions on constructive real numbers (Russian). Comment. Math. Univ. Carolin., 19(2):319-333, 1978.

• Osvald Demuth. Some questions of the theory of constructive functions of a real variable (Russian). Acta Universitatis Carolinae. Mathematica et Physica, 19(1):61-96, 1978.

• Osvald Demuth. Constructive Denjoy integrals (Russian). Commentationes Mathematicae Universitatis Carolinae, 20(2):213-227, 1979.

• Osvald Demuth. The use of the Riemann-Stieltjes integral in the theory of the constructive Lebesgue integral, and its generalizations (Russian). Commentationes Mathematicae Universitatis Carolinae, 20(4):781-793, 1979.

• Osvald Demuth. A constructive analogue of K. M. Garg's theorem on derivative numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 21(3):457-472, 1980.

• Osvald Demuth. On the constructive Perron integral (Russian). Acta Universitatis Carolinae. Mathematica et Physica, 21(1):3-57, 1980.

• Osvald Demuth. Pseudodifferentiability of constructive functions on constructive real numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 21(3):489-505, 1980.

• Osvald Demuth. A generalization of a constructive analogue of K. M. Garg's theorem (Russian). Commentationes Mathematicae Universitatis Carolinae, 22(3):607-620, 1981.

• Osvald Demuth. On the pseudodifferentiability of uniformly continuous constructive functions from functions of the same type (Russian). Commentationes Mathematicae Universitatis Carolinae, 22(3):497-512, 1981.

• Osvald Demuth. Borel types of some classes of arithmetical real numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 23(3):593-606, 1982.

• Osvald Demuth. Some classes of arithmetical real numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 23(3):453-465, 1982.

• Osvald Demuth. Arithmetic complexity of differentiation in constructive mathematics (Russian). Commentationes Mathematicae Universitatis Carolinae, 24(2):301-316, 1983.

• Osvald Demuth. On the pseudodifferentiability of pseudo-uniformly continuous constructive functions from functions of the same type (Russian). Commentationes Mathematicae Universitatis Carolinae, 24(3):391-406, 1983.

• Osvald Demuth. An example of the construction of pseudonumbers by the methods of recursion theory. In R.N. Tonoyan, editor, Applied mathematics, No. 5 (Russian), pages 55-73, 131-132, Erevan, 1987. Erevan. Univ.

• Oswald Demuth. A notion of semigenericity. Commentationes Mathematicae Universitatis Carolinae, 28(1):71-84, 1987.

• Osvald Demuth. Reducibilities of sets based on constructive functions of a real variable. Commentationes Mathematicae Universitatis Carolinae, 29(1):143-156, 1988.

• Osvald Demuth. Remarks on the structure of tt-degrees based on constructive measure theory. Commentationes Mathematicae Universitatis Carolinae, 29(2):233-247, 1988.

• Osvald Demuth. Remarks on Denjoy sets. In Mathematical logic, pages 267-280, New York, 1990. Plenum.

• Phan Dình-Diêu. Constructive locally convex linear topological spaces (Russian). Doklady Akademii Nauk, 162:766-769, 1965.

• Phan Dình-Diêu. The metrizability, normability and multinormability of constructive locally convex spaces (Russian). Doklady Akademii Nauk, 162:1011-1014, 1965.

• Phan Dình-Diêu. On conjugates to constructive, locally convex spaces (Russian). Doklady Akademii Nauk, 166:45-48, 1966.

• Phan Dình-Diêu. Certain properties of constructive generalized functions (Russian). Doklady Akademii Nauk, 174:298-301, 1967.

• Phan Dình-Diêu. Closed and open sets in constructive topological spaces (Russian). Trudy Mat. Inst. Steklova, 93:250-256, 1967.

• Phan Dình-Diêu. Constructive generalized functions (Russian). Doklady Akademii Nauk, 174:37-40, 1967.

• Phan Dình-Diêu. A language for constructive mathematics, connected with systems of sets (Russian). Trudy Mat. Inst. Steklova, 93:123-141, 1967.

• Phan Dình-Diêu. Spaces of constructive infinitely differentiable functions, and functionals therein (Russian). Doklady Akademii Nauk, 180:799-802, 1968.

• Phan Dình-Diêu. Some questions in constructive functional analysis, volume 114 of Proceedings of the Steklov Institute of Mathematics. American Mathematical Society, Providence, 1974.

• Michael G. Gelfond. Constructive pseudofunctions (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 16:20-27, 1969.

• Michael G. Gelfond. The relation between the classical and constructive versions of the construction of mathematical analysis (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 32:5-11, 1972.

• Michael G. Gelfond. A class of theorems with valid constructive counterparts. In Fred Richman, editor, Constructive mathematics, volume 873 of Lecture Notes in Mathematics, pages 314-320, Berlin, 1981. Springer. Conference held at the New Mexico State University, Las Cruces, N.M., August 11-15, 1980.

• M.I. Kanovic and B.A. Kusner. Complexity of algorithms, and Specker sequences. In Studies in the Theory of Algorithms and Mathematical Logic, volume Vol. 2, pages 77-63,160. Vycisl. Centr. Akad. Nauk SSSR, 1976. (in Russian).

• Boris Abramovich Kusner. Riemann integration in constructive analysis (Russian). Dokl. Akad. Nauk SSSR, 156:255-257, 1964. [translated in: Soviet Math.-Dokl., 5 (1964) 628-630].

• Boris Abramovich Kusner. Constructive theory of the Riemann integral (Russian). Dokl. Akad. Nauk SSSR, 165:1238-1240, 1965. [translated in: Soviet Math.-Dokl. 6 (1965) 1584-1587].

• Boris Abramovich Kusner. The existence of unbounded constructive analytic functions (Russian). Dokl. Akad. Nauk SSSR, 160:29-31, 1965. [translated in: Soviet Math.-Dokl., 6 (1965) 26-28].

• Boris Abramovich Kusner. On constructive antiderivatives (Russian). Mat. Zametki, 2:157-166, 1967. [translated as: Primitive constructive functions, Math. Notes, 2 (1967) 577-582].

• Boris Abramovich Kusner. A remark on the domains of definition of constructive analytic functions (Russian). Zap. Naucn. Sem. Leningrad. Otdel. Inst. Steklov., 8:103-106, 1968.

• Boris Abramovich Kusner. Some mass problems connected with the integration of constructive functions (Russian). Trudy Mat. Inst. Steklov., 113:39-72, 1970. [translated in: Proc. Stehlov Inst. Math., 113 (1970) 42-83].

• Boris Abramovich Kusner. Computationally complex real numbers (Russian). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 19:447-452, 1973.

• Boris Abramovich Kusner. Continuity theorems for some types of computable operators (Russian). Dokl. Akad. Nauk SSSR, 208:1031-1034, 1973. [translated in: Soviet Math. - Dokl., 14 (1973) 221-225].

• Boris Abramovich Kusner. Lectures on Constructive Mathematical Analysis (Russian). Izdat. Nauka, 1973. translated: by Mendelson, E., and edited by Leifman, L.J., Transl. Math. Monographs, 60 (1984).

• Boris Abramovich Kusner. 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), pages 87-111, 215, 1974. (Vycisl. Centr Akad. Nauk SSSR).

• Boris Abramovich Kusner. On a type of computable real function (Russian). Dokl. Akad. Nauk SSSR, 215:259-262, 1974. [translated in: Soviet Math. - Dokl., 15 (1974) 466-470].

• Boris Abramovich Kusner. The computation of isolated roots of constructive functions (Russian). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22:311-332, 1976.

• Boris Abramovich Kusner. On Grzegorczyk's theorem on the computability of an isolated extremum (Russian). In A.A. Markov and B.A. Kusner, editors, Studies in the Theory of Algorithms and Mathematical Logic, volume 2, pages 112-121, 158, 1976. (Vycisl. Centr Akad. Nauk SSSR).

• Boris Abramovich Kusner. Segmental coverings and uniform continuity of constructive functions (Russian). In A.A. Markov and V.I. Homic, editors, Studies in the Theory of Algorithms and Mathematical Logic, pages 62-69, 133. Nauka, 1979.

• Boris Abramovich Kusner. Behavior of the general term of a Specker series (Russian). In M. Gladkii, editor, Mathematical Logic and Mathematical Linguistics, pages 112-116. Kalinin. Gos. Univ., 1981.

• Boris Abramovich Kusner. On some topological properties of constructive plane curves (Russian). Dokl. Akad. Nauk SSSR, 260:281-283, 1981. [translated in: Soviet Math. - Dokl., 24 (1981) 258-261].

• Boris Abramovich Kusner. Some extensions of Markov's constructive continuum and their applications to the theory of constructive functions. In A.S. Troelstra and D. van Dalen, editors, The L.E.J. Brouwer Centenary Symposium (Noordwijkerhout, June 8-13,1981), volume 110 of Studies in Logic and the Foundations of Mathematics, pages 261-273, Amsterdam, 1982. North-Holland.

• Boris Abramovich Kusner. A class of Specker sequences (Russian). In M. Gladlii, editor, Mathematical Logic, Mathematical Linguistics and Theory of Algorithms, pages 62-65. Kalinin. Gos. Univ., 1983.

• Boris Abramovich Kusner. Lectures on Constructive Mathematical Analysis, volume 60 of Translations of Mathematical Monographs. American Mathematical Society, Providence, 1984.

• Boris Abramovich Kusner. Differentiability and uniform continuity of constructive functions (Russian). Doklady Akademii Nauk, 281:1314-1316, 1985. [translated in: Soviet Math. - Dokl., 31 (1985) 433-435].

• Boris Abramovich Kusner. The principle of bar-induction in Brouwer's theory of the continuum (Russian). In M.I. Panov, editor, Patterns in the Development of Modern Mathematics, Methodological Aspects, pages 230-250. Nauka, 1987.

• Boris Abramovich Kusner. The constructive mathematics of A.A. Markov: some reflections (Russian). Modern Logic, 3:119-144, 1993.

• Boris Abramovich Kusner. Markov and Bishop: an essay in memory of A.A. Markov (1903-1979) and E. Bishop (1928-1983). In S. Zdrovkovska and P.L. Duren, editors, Golden Years of Moscow Mathematics, volume 6 of Hist. Math., pages 179-197, 1993.

• Boris Abramovich Kusner. Kurt Gödel and the constructive mathematics of A.A. Markov. In P. Hájek, editor, Gödel '96, volume 6 of Lecture Notes in Logic, pages 50-63, 1996. Proc. Conf, Brno, August 1996.

• A. Kucera, , and B. Kusner. A type of recursive isomorphism of certain concepts of constructive analysis (Russian). Comment. Math. Univ. Carolinæ, 19:97-105, 1978.

• S.N. Manukjan and I.D. Zaslavskii. Partitionings of the plane by constructive curves (Russian). Trudy Vycisl. Centr. Akad. Nauk Armjan. SSR i Erevan. Gos. Univ., 5:26-138, 1968.

• A.A. Markov. On the continuity of constructive functions (Rrussian). Uspekhi Mat. Nauk (N.S.), 9:226-230, 1954.

• A.A. Markov. On constructive functions. Trudy Mat. Inst. Steklov, 52:315-348, 1958. (in Russian, English trans. in AMS Trans. (2) 29, 1963).

• Yu.V. Matijasevic, G.E. Mints, V.P. Orevkov, and A.O. Slisenko. Nikolai Aleksandrovich Shanin (on his seventieth birthday), (Russian). Uspekhi Mat. Nauk, 45:205-206, 1990. [translated in: Russian Math. Surveys, 45:1 (1990) 239-240].

• Elena Ju. Nogina. Effectively topological spaces. Dokl. Akad. Nauk SSSR, 169:28-31, 1966.

• Elena Ju. Nogina. Correlations between certain classes of effectively topological spaces. Mat. Zametki, 5:483-495, 1969.

• Elena Ju. Nogina. Enumerable topological spaces (Russian). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24(2):141-176, 1978.

• Elena Ju. Nogina. The relation between separability and traceability of sets (Russian). In Mathematical logic and mathematical linguistics, pages 135-144. Kalinin. Gos. Univ., Klinin, 1981.

• V.P. Orevkov and N.A. v Sanin, editors. Problems in the constructive trend in mathematics VI. American Mathematical Society, Providence, R.I., 1975. Proc. Steklov Inst. Math., 129 (1973).

• V.P. Orevkov. Constructive mappings of polyhedra (Russian). Doklady Akademii Nauk, 152:278-281, 1963.

• V.P. Orevkov. A constructive mappping of the square onto itself displacing every constructive point (Russian). Doklady Akademii Nauk, 152:55-58, 1963. translated in: Soviet Math. - Dokl., 4 (1963) 1253-1256.

• V.P. Orevkov. Certain questions of the theory of polynomials with constructive real coefficients (Russian). Trudy Mat. Inst. Steklov., 72:462-487, 1964.

• V.P. Orevkov. On constructive mappings of a circle into itself (Russian). Trudy Mat. Inst. Steklov., 72:437-461, 1964.

• V.P. Orevkov. Certain types of continuity of constructive operators (Russian). Trudy Mat. Inst. Steklov., 93:164-186, 1967.

• V.P. Orevkov. Constructive mappings of finite polyhedra (Russian). Trudy Mat. Inst. Steklov., 93:142-163, 1967.

• V.P. Orevkov. Certain properties of homeomorphisms of constructive metric spaces (Russian). Zap. Naucn. Sem. Leningrad. Otdel. Inst. Steklov., 16:157-164, 1969.

• V.P. Orevkov. The continuity of constructive functionals (Russian). Zap. Naucn. Sem. Leningrad. Otdel. Inst. Steklov., 20:160-169,287, 1971.

• V.P. Orevkov. The complexity of the expansion of algebraic irrationalities in continued fractions (Russian). Trudy Mat. Inst. Steklov., 129:24-29,267, 1973.

• V.P. Orevkov. A new proof of the uniqueness theorem for constructive differentiable functions of a complex variable (Russian). Zap. Naucn. Sem. Leningrad. Otdel. Inst. Steklov., 40:119-126,159, 1974.

• N.A. Sanin. Some problems of mathematical analysis in the light of constructive logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 2:27-36, 1956.

• N.A. Sanin. A hierarchy of ways of understanding judgments in constructive mathematics (Russian). Trudy Mat. Inst. Steklov., 129:203-266, 1973.

• N.A. Sanin. The hierarchy of constructive Brouwer functionals (Russian). Zap. Naucn. Sem. Otdel. Mat. Inst. Steklov., 40:142-147, 1974. dedicated to A.A. Markov on the occasion of his seventieth birthday.

• N.A. Sanin. Canonical recursive functions and operations (Russian). Zap. Naucn. Sem. Otdel. Mat. Inst. Steklov., 88:218-235,246-247, 1979.

• N.A. Sanin. Georg Cantor as the author of constructions that play fundamental roles in constructive mathematics (Russian). Zap. Naucn. Sem. Otdel. Mat. Inst. Steklov. POMI, 220:5-22,246-145, 1995.

• N.A. Sanin. On a finitary version of mathematical analysis. Annals of Pure and Applied Logic, 113:261-295, 2002.

• A.O. Slisenko. Examples of a nondiscontinuous but not continuous constructive operator in a metric space. Trudy Mat. Inst. Steklov, 72:524-532, 1964. (in Russian, English trans. in AMS Trans. 100, 1972).

• Ju. R. Va ui nberg and Elena Ju. Nogina. Categories of effectively topological spaces. In Studies in formalized languages and nonclassical logics (Russian), pages 253-273. Izdat. ``Nauka'', Moscow, 1974.

• Ju. R. Va ui nberg and Elena Ju. Nogina. Two types of continuity of computable mappings of numerated topological spaces. In Studies in the theory of algorithms and mathematical logic, Vol. 2 (Russian), pages 84-99, 159. Vy v cisl. Centr Akad. Nauk SSSR, Moscow, 1976.

• I.D. Zaslavskij. Disproof of some theorems of classical analysis in constructive analysis. Usp. Mat. Nauk, 10(4):209-210, 1955. (in Russian).

• I.D. Zaslavskij. Some properties of constructive real numbers and constructive functions. Tr. Mat. Inst. Steklov, 67(4):385-457, 1962. (in Russian, english translation in: Amer. Math. Soc. Translations 2 57,1-84(1966).

• I.D. Zaslavskij. On the differentiation and integration of constructive functions. Doklady Akademii Nauk, 156:25-27, 1964. (Russian).

• I.D. Zaslavskij. Rectifiability of constructive plane curves. Izv. Akad. Nauk Armjan. SSR Ser. Mat., 2:69-82, 1967. (Russian).

Books on Related Topics

• Oliver Aberth. Precise numerical methods using C++. Academic Press, San Diego, 1998.

• Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale. Complexity and Real Computation. Springer, New York, 1998.

• A. Borodin and I. Munro. The Computational Complexity of Algebraic and Numeric Problems. Elsevier, New York, 1975.

• Douglas Bridges and Luminita Vîta. Techniques of Constructive Analysis. Springer, New York, 2006.

• Cristian Calude. Information and Randomness. Monographs in Theoretical Computer Science. Springer, Berlin, 1994.

• John Earman. A Primer on Determinism, volume 32 of The University of Western Ontario Series in Philosophy of Science. D. Reidel, Dordrecht, 1986.

• Ju. L. Ersov, S.S. Goncharov, A. Nerode, and J.B. Remmel. Handbook of Recursive Mathematics, volume 138 of Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 1999. Volume 1, Recursive Model Theory.

• Ju. L. Ersov, S.S. Goncharov, A. Nerode, and J.B. Remmel. Handbook of Recursive Mathematics, volume 139 of Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 1999. Volume 2, Recursive Algebra, Analysis and Combinatorics.

• G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M.W. Mislove, and D.S. Scott. Continuous lattices and domains. Cambridge University Press, Cambridge, 2003.

• Edward R. Griffor. Handbook of Computability Theory, volume 140 of Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 1999.

• John Harrision. Theorem Proving with the Real Numbers. CPHC/BCS Distinguished Dissertations. Springer, London, 1998.

• Alexander S. Kechris. Classical Descriptive Set Theory, volume 156 of Graduate Texts in Mathematics. Springer, Berlin, 1995.

• Vladik Kreinovich, Anatoly Lakeyev, Jirí Rohn, and Patrick Kahl. Computational Complexity and Feasibility of Data Processing and Interval Computations, volume 10 of Applied Optimization. Kluwer Academic Publishers, Dordrecht, 1998.

• Ming Li and Paul Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Graduate Texts in Computer Science. Springer, New York, 2nd edition, 1997.

• Ramon E. Moore. Methods and applications of interval analysis. SIAM Journal on Computing, 1979.

• Yiannis Nicholas Moschovakis. Descriptive Set Theory, volume 100 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1980.

• Jean-Michel Muller. Elementary Functions, Algorithms and Implementation. Birkhäuser, Boston, 1997.

• A. Schönhage, A.F.W. Grotefeld, and E. Vetter. Fast Algorithms. B.I. Wissenschaftsverlag, Mannheim, 1994.

• Yaroslav D. Sergeyev. Arithmetic of infinity. Edizioni Orizzonti Meridionali, Cosenza, 2003.

• Stephen G. Simpson. Subsystems of Second Order Arithmetic. Perspectives in Mathematical Logic. Springer, Berlin, 1999.

• Dimiter G. Skordev. Computability in Combinatory Spaces, volume 55 of Mathematics and Its Applications (East European Series). Kluwer Academic Publishers, Dordrecht, 1992. An Algebraic Generalization of Abstract First Order Computability.

• V. Stoltenberg-Hansen, I. Lindström, and E.R. Griffor. Mathematical Theory of Domains, volume 22 of Cambrige Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1994.

• Joseph F. Traub, G.W. Wasilkowski, and H. Wozniakowski. Information-Based Complexity. Computer Science and Scientific Computing. Academic Press, New York, 1988.

• J.V. Tucker and J.I. Zucker. Program Correctness over Abstract Data Types, with Error-State Semantics, volume 6 of CWI Monographs. North-Holland, Amsterdam, 1988.

• Shmuel Weinberger. Computers, Rigidity, and Moduli: The Large-Scale Fractal Geometry of Riemannian Moduli Space. Princeton University Press, New Jersey, 2004.

© 1997 until now - Vasco Brattka