This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
O. Aberth (1974) A precise numerical analysis program. Communications of the ACM 17 (9) 509–513.
O. Aberth and M. J. Schaefer (1992) Precise computation using range arithmetic, via C++. ACM Trans. Math. Softw. 18 (4) 481–491.
V. Brattka and P. Hertling (1998) Feasible Real Random Access Machines. Journal of Complexity 14 (4) 490–526.
A. Edalat and P. Sünderhauf (1999) A domain-theoretic approach to computability on the real line. Theoretical Computer Science 210 (1) 73–98.
K.-I. Ko (1991) Complexity Theory of Real Functions, Birkhäuser.
B. Lambov (2005) Complexity and Intensionality in a Type-1 Framework for Computable Analysis. Springer-Verlag Lecture Notes in Computer Science 3634 442–461.
V. A. Lee Jr. and H.-J. Boehm (1990) Optimizing Programs over the Constructive Reals. In: Conference on Programming Language Design and Implementation, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, ACM Press102–111.
M. B. Pour-El and J. I. Richards (1989) Computability in Analysis and Physics, Springer-Verlag.