1. O. Aberth, Computable Analysis. McGraw-Hill, New York 1980.
2. K. Ambos-Spies, K. Weihrauch, and X. Zheng, Weakly computable real numbers, J. Complexity
16 (2000) 676–690.
3. S. Banach and S. Mazur, Sur les fonctions calculables, Ann. Soc. Pol. de Math.
16 (1937) 223.
4. A. Bauer, The Realizability Approach to Computable Analysis and Topology, PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh 2000.
5. A. Bauer, A relationship between equilogical spaces and type two effectivity, in: S. Brooks and M. Mislove (eds.), Seventeenth Conference on the Mathematical Foundations of Programming Semantics, vol. 45 of Elect. Not. Theoret. Comp. Sci., Elsevier, Amsterdam 2001.