Computability and Complexity in Analysis

4th International Workshop, CCA 2000 Swansea, UK, September 17–19, 2000 Selected Papers

  • Jens Blanck
  • Vasco Brattka
  • Peter Hertling
Conference proceedings CCA 2000

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2064)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Computability and Complexity in Analysis

    1. Jens Blanck
      Pages 1-15
    2. Anthony J. Dunlop, Marian Boykan Pour-El
      Pages 16-29
    3. Paul Gowland, David Lester
      Pages 30-47
    4. Namhyun Hur, James H. Davenport
      Pages 82-87
    5. Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna
      Pages 187-199
    6. Takakazu Mori
      Pages 200-221
    7. Norbert Th. Müller
      Pages 222-252
    8. Daniel Richardson
      Pages 253-272
    9. Matthias Schröder
      Pages 273-295
    10. Hideki Tsuiki
      Pages 323-335
    11. Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori
      Pages 336-356
    12. Klaus Weihrauch, Ning Zhong
      Pages 369-377
    13. Martin Ziegler, Vasco Brattka
      Pages 378-388
  3. Report on Competition

  4. Back Matter
    Pages 394-394

About these proceedings


The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.


Analysis Arithmetic C++ programming language Complexity Theory Computability Computational Complexity Computational Mathematics Exact Arithmetics Numerical Analysis Numerical Mathematics Recursive Functions Topological Spaces Turing calculus complexity

Editors and affiliations

  • Jens Blanck
    • 1
  • Vasco Brattka
    • 2
  • Peter Hertling
    • 2
  1. 1.University of Wales SwanseaSwanseaUK
  2. 2.InformatikzentrumFernUniversität HagenHagenGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42197-9
  • Online ISBN 978-3-540-45335-2
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment