↓ Skip to main content

Computability and Complexity in Analysis

Overview of attention for book
Cover of 'Computability and Complexity in Analysis'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Effectivity of Regular Spaces
  3. Altmetric Badge
    Chapter 2 The Degree of Unsolvability of a Real Number
  4. Altmetric Badge
    Chapter 3 A Survey of Exact Arithmetic Implementations
  5. Altmetric Badge
    Chapter 4 Standard Representations of Effective Metric Spaces
  6. Altmetric Badge
    Chapter 5 Banach-Mazur Computable Functions on Metric Spaces
  7. Altmetric Badge
    Chapter 6 A Generic Root Operation for Exact Real Arithmetic
  8. Altmetric Badge
    Chapter 7 Effective Contraction Theorem and Its Application
  9. Altmetric Badge
    Chapter 8 Polynomially Time Computable Functions over p -Adic Fields
  10. Altmetric Badge
    Chapter 9 On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems
  11. Altmetric Badge
    Chapter 10 Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
  12. Altmetric Badge
    Chapter 11 Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations
  13. Altmetric Badge
    Chapter 12 δ-Approximable Functions
  14. Altmetric Badge
    Chapter 13 Computabilities of Fine-Continuous Functions
  15. Altmetric Badge
    Chapter 14 The iRRAM: Exact Arithmetic in C++
  16. Altmetric Badge
    Chapter 15 The Uniformity Conjecture
  17. Altmetric Badge
    Chapter 16 Admissible Representations of Limit Spaces
  18. Altmetric Badge
    Chapter 17 Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
  19. Altmetric Badge
    Chapter 18 Effective Fixed Point Theorem over a Non-Computably Separable Metric Space
  20. Altmetric Badge
    Chapter 19 Computational Dimension of Topological Spaces
  21. Altmetric Badge
    Chapter 20 Some Properties of the Effective Uniform Topological Space
  22. Altmetric Badge
    Chapter 21 On Computable Metric Spaces Tietze-Urysohn Extension Is Computable
  23. Altmetric Badge
    Chapter 22 Is the Linear Schrödinger Propagator Turing Computable?
  24. Altmetric Badge
    Chapter 23 A Computable Spectral Theorem
  25. Altmetric Badge
    Chapter 24 Exact Real Arithmetic Systems: Results of Competition
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
3 Wikipedia pages

Readers on

mendeley
4 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Computability and Complexity in Analysis
Published by
Springer Berlin Heidelberg, June 2003
DOI 10.1007/3-540-45335-0
ISBNs
978-3-54-042197-9, 978-3-54-045335-2
Editors

Blanck, Jens, Brattka, Vasco, Hertling, Peter

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
France 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Professor 2 50%
Student > Ph. D. Student 1 25%
Researcher 1 25%
Readers by discipline Count As %
Computer Science 3 75%
Engineering 1 25%