A Tutorial on Computable Analysis

This publication has 77 references indexed in Scilit:

• On Computational Complexity of Siegel Julia Sets
  Communications in Mathematical Physics, 2006
• The approximation structure of a computably approximable real
  The Journal of Symbolic Logic, 2003
• Weakly Computable Real Numbers
  Journal of Complexity, 2000
• Domain representations of topological spaces
  Theoretical Computer Science, 2000
• Computable invariance
  Theoretical Computer Science, 1999
• Complexity and Real Computation
  1998
• Topologies on Closed and Closed Convex Sets
  1993
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
  Bulletin of the American Mathematical Society, 1989
• Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes
  Archive for Mathematical Logic, 1985
• Signed-Digit Numbe Representations for Fast Parallel Arithmetic
  IEEE Transactions on Electronic Computers, 1961