[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Computability and Complexity in Analysis

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

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Jens Blanck

    1. University of Wales Swansea, Swansea, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Vasco Brattka

    1. Informatikzentrum, FernUniversität Hagen, Hagen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Peter Hertling

    1. Informatikzentrum, FernUniversität Hagen, Hagen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: CCA 2000.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Keywords

Table of contents (24 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Computability and Complexity in Analysis

    1. Effectivity of Regular Spaces

      • Jens Blanck
      Pages 1-15

    2. The Degree of Unsolvability of a Real Number

      • Anthony J. Dunlop, Marian Boykan Pour-El
      Pages 16-29

    3. A Survey of Exact Arithmetic Implementations

      • Paul Gowland, David Lester
      Pages 30-47

    4. Standard Representations of Effective Metric Spaces

      • Armin Hemmerling
      Pages 48-68

    5. Banach-Mazur Computable Functions on Metric Spaces

      • Peter Hertling
      Pages 69-81

    6. A Generic Root Operation for Exact Real Arithmetic

      • Namhyun Hur, James H. Davenport
      Pages 82-87

    7. Effective Contraction Theorem and Its Application

      • Hiroyasu Kamo
      Pages 88-100

    8. Polynomially Time Computable Functions over p-Adic Fields

      • George Kapoulas
      Pages 101-118

    9. On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems

      • Ulrich Kohlenbach
      Pages 119-145

    10. Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory

      • Margarita V. Korovina, Oleg V. Kudinov
      Pages 146-168

    11. Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations

      • Marko Krznarić
      Pages 169-186

    12. δ-Approximable Functions

      • Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna
      Pages 187-199

    13. Computabilities of Fine-Continuous Functions

      • Takakazu Mori
      Pages 200-221

    14. The iRRAM: Exact Arithmetic in C++

      • Norbert Th. Müller
      Pages 222-252

    15. The Uniformity Conjecture

      • Daniel Richardson
      Pages 253-272

    16. Admissible Representations of Limit Spaces

      • Matthias Schröder
      Pages 273-295

    17. Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions

      • Dimiter Skordev
      Pages 296-309

    18. Effective Fixed Point Theorem over a Non-Computably Separable Metric Space

      • Izumi Takeuti
      Pages 310-322

    19. Computational Dimension of Topological Spaces

      • Hideki Tsuiki
      Pages 323-335
Back to top

Other volumes

  1. Computability and Complexity in Analysis

Editors and Affiliations

  • University of Wales Swansea, Swansea, UK

    Jens Blanck

  • Informatikzentrum, FernUniversität Hagen, Hagen, Germany

    Vasco Brattka, Peter Hertling

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation