Save today: Get 40% off titles in Popular Science!

Lecture Notes in Computer Science

Computability and Complexity in Analysis

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

Editors: Blanck, Jens, Brattka, Vasco, Hertling, Peter (Eds.)

Free Preview

Buy this book

eBook $69.99
price for USA in USD
  • ISBN 978-3-540-45335-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA in USD
About this book

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.

Table of contents (24 chapters)

Table of contents (24 chapters)
  • Effectivity of Regular Spaces

    Pages 1-15

    Blanck, Jens

  • The Degree of Unsolvability of a Real Number

    Pages 16-29

    Dunlop, Anthony J. (et al.)

  • A Survey of Exact Arithmetic Implementations

    Pages 30-47

    Gowland, Paul (et al.)

  • Standard Representations of Effective Metric Spaces

    Pages 48-68

    Hemmerling, Armin

  • Banach-Mazur Computable Functions on Metric Spaces

    Pages 69-81

    Hertling, Peter

Buy this book

eBook $69.99
price for USA in USD
  • ISBN 978-3-540-45335-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA in USD
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Computability and Complexity in Analysis
Book Subtitle
4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers
Editors
  • Jens Blanck
  • Vasco Brattka
  • Peter Hertling
Series Title
Lecture Notes in Computer Science
Series Volume
2064
Copyright
2001
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-45335-2
DOI
10.1007/3-540-45335-0
Softcover ISBN
978-3-540-42197-9
Series ISSN
0302-9743
Edition Number
1
Number of Pages
VIII, 396
Topics