1. Aho, A., Hopcraft, J., and Ullman, J. [1979], The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.
2. Blum, L. and Shub, M. [1986], Evaluating rational functions: Infinite precision is finite cost and tractable on average, SIAM J. Comput. 15, 384–398.
3. Blum, L., Shub, M., and Smale, S. [1989], On a theory of computation and complexity over the real numbers: NP-completeness, Recursive functions and Universal Machines, Bull. Amer. Math. Soc. 21, 1–46.
4. Blum, L. and Smale, S. [1993], The Gödel incompleteness theorem and decidability over a ring, this volume.
5. Branin, Jr., F.H. [1972], Widely convergent methods for finding multiple solutions of simultaneous non-linear equations, IBM J. Res. Develop. 16, (5) 504–522.