4. CCA 2000: Swansea, UK

@proceedings{DBLP:conf/cca/2000,
  editor    = {Jens Blanck and
               Vasco Brattka and
               Peter Hertling},
  title     = {Computability and Complexity in Analysis, 4th International Workshop,
               CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers},
  booktitle = {CCA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2064},
  year      = {2001},
  isbn      = {3-540-42197-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Computability and Complexity in Analysis

• Jens Blanck:
  Effectivity of Regular Spaces. 1-15
  Electronic Edition (Springer LINK) BibTeX
• Anthony J. Dunlop, Marian Boykan Pour-El:
  The Degree of Unsolvability of a Real Number. 16-29
  Electronic Edition (Springer LINK) BibTeX
• Paul Gowland, David Lester:
  A Survey of Exact Arithmetic Implementations. 30-47
  Electronic Edition (Springer LINK) BibTeX
• Armin Hemmerling:
  Standard Representations of Effective Metric Spaces. 48-68
  Electronic Edition (Springer LINK) BibTeX
• Peter Hertling:
  Banach-Mazur Computable Functions on Metric Spaces. 69-81
  Electronic Edition (Springer LINK) BibTeX
• Namhyun Hur, James H. Davenport:
  A Generic Root Operation for Exact Real Arithmetic. 82-87
  Electronic Edition (Springer LINK) BibTeX
• Hiroyasu Kamo:
  Effective Contraction Theorem and Its Application. 88-100
  Electronic Edition (Springer LINK) BibTeX
• George Kapoulas:
  Polynomially Time Computable Functions over p-Adic Fields. 101-118
  Electronic Edition (Springer LINK) BibTeX
• Ulrich Kohlenbach:
  On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems. 119-145
  Electronic Edition (Springer LINK) BibTeX
• Margarita V. Korovina, Oleg V. Kudinov:
  Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. 146-168
  Electronic Edition (Springer LINK) BibTeX
• Marko Krznaric:
  Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations. 169-186
  Electronic Edition (Springer LINK) BibTeX
• Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna:
  delta-Approximable Functions. 187-199
  Electronic Edition (Springer LINK) BibTeX
• Takakazu Mori:
  Computabilities of Fine-Continuous Functions. 200-221
  Electronic Edition (Springer LINK) BibTeX
• Norbert Th. Müller:
  The iRRAM: Exact Arithmetic in C++. 222-252
  Electronic Edition (Springer LINK) BibTeX
• Daniel Richardson:
  The Uniformity Conjecture. 253-272
  Electronic Edition (Springer LINK) BibTeX
• Matthias Schröder:
  Admissible Representations of Limit Spaces. 273-295
  Electronic Edition (Springer LINK) BibTeX
• Dimiter Skordev:
  Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions. 296-309
  Electronic Edition (Springer LINK) BibTeX
• Izumi Takeuti:
  Effective Fixed Point Theorem over a Non-computably Separable Metric Space. 310-322
  Electronic Edition (Springer LINK) BibTeX
• Hideki Tsuiki:
  Computational Dimension of Topological Spaces. 323-335
  Electronic Edition (Springer LINK) BibTeX
• Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori:
  Some Properties of the Effective Uniform Topological Space. 336-356
  Electronic Edition (Springer LINK) BibTeX
• Klaus Weihrauch:
  On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. 357-368
  Electronic Edition (Springer LINK) BibTeX
• Klaus Weihrauch, Ning Zhong:
  Is the Linear Schrödinger Propagator Turing Computable? 369-377
  Electronic Edition (Springer LINK) BibTeX
• Martin Ziegler, Vasco Brattka:
  A Computable Spectral Theorem. 378-388
  Electronic Edition (Springer LINK) BibTeX

Report on Competition

• Jens Blanck:
  Exact Real Arithmetic Systems: Results of Competition. 389-394
  Electronic Edition (Springer LINK) BibTeX