Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 17-19, 2000, selected papers

Table of Contents:

• 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 Fields
• 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 C++
• 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

Includes bibliographical references and index