Texts Books | READER Loading...

Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 17 19, | Blanck, Jens, 1966-, Brattka, Vasco, 1966-, Hertling, Peter, 1965-

Deal Score+2
Telegram icon Share on Telegram

Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 17 19,

User Rating: Be the first one!

Author: Blanck, Jens, 1966-, Brattka, Vasco, 1966-, Hertling, Peter, 1965-

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2001

Language: eng

Subjects: Mathematical analysis, Computable functions, Computational complexity

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540421971

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 185.29 MB

PDF Size: 4.45 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 399

Views: 449

Total Files: 18

Media Type: texts

Description

Computability and Complexity in Analysis: 4th International Workshop, CCA 2000 Swansea, UK, September 17–19, 2000 Selected Papers
Author: Jens Blanck, Vasco Brattka, Peter Hertling
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42197-9
DOI: 10.1007/3-540-45335-0

Table of Contents:

  • Effectivity of Regular Spaces
  • The Degree of Unsolvability of a Real Number
  • A Survey of Exact Arithmetic Implementations
  • Standard Representations of Effective Metric Spaces
  • Banach-Mazur Computable Functions on Metric Spaces
  • A Generic Root Operation for Exact Real Arithmetic
  • Effective Contraction Theorem and Its Application
  • Polynomially Time Computable Functions over p-Adic Fields
  • On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems
  • Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
  • Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations
  • δ-Approximable Functions
  • Computabilities of Fine-Continuous Functions
  • The iRRAM: Exact Arithmetic in C++
  • The Uniformity Conjecture
  • Admissible Representations of Limit Spaces
  • Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
  • Effective Fixed Point Theorem over a Non-Computably Separable Metric Space
  • Computational Dimension of Topological Spaces
  • Some Properties of the Effective Uniform Topological Space

Includes bibliographical references and index
READER
Logo
Compare items
  • Total (0)
Compare
0
Shopping cart