Computability and Complexity in Analysis

"This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Computability and Complexity in Analysis, CCA 2000, held in Swansea, UK, in September 2000.
The 23 revised full papers presented together with a report on a competition of exact real arithmetic systems were carefully selected from 28 papers accepted for presentation during the workshop. The book presents a cross-section on current research on computability and complexity in analysis."

Computability and Complexity in Analysis
Effectivity of Regular Spaces
The Degree of Unsolvability of a Real Number
A Survey of Exact Arithmetic Implementations
Standard Representations of Effective Metric Spaces
Banach-Mazur Computable Functions on Metric Spaces
A Generic Root Operation for Exact Real Arithmetic
Effective Contraction Theorem and Its Application
Polynomially Time Computable Functions over p-Adic Fiel
On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations
　бApproximable Functions
Computabilities of Fine-Continuous Functions
The iRRAM: Exact Arithmetic in CA-+
The Uniformity Conjecture
Admissible Representations of Limit Spaces
Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
Effective Fixed Point Theorem over a Non-computably Separable Metric Space
Computational Dimension of Topological Spaces
Some Properties of the Effective Uniform Topological Space
On Computable Metric Spaces Tietze-Urysohn Extension Is Computable
Is the Linear Schrodinger Propagator Turing Computable?
A Computable Spectral Theorem
Report on Competition
Exact Real Arithmetic Systems: Results of Competition
Author Index