Computability and Complexity in Analysis

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

Häftad, Engelska, 2001

Av Jens Blanck, Vasco Brattka, Peter Hertling

859 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Computability and Complexity in Analysis, CCA 2000, held in Swansea, UK, in September 2000. The 23 revised full papers presented together with a report on a competition of exact real arithmetic systems were carefully selected from 28 papers accepted for presentation during the workshop. The book presents a cross-section on current research on computability and complexity in analysis.

Produktinformation

Utgivningsdatum2001-05-23
Mått155 x 233 x 23 mm
Vikt616 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor396
Upplaga2001
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540421979

Tillhör följande kategorier

Matematikens grunder inom Naturvetenskap och teknik
Systemvetenskap och AI inom Data och it
Programspråk inom Data och it
Programmeringsböcker inom Data och it
Databaser inom Data och it

Computability and Complexity in Analysis.- 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.- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.- Is the Linear Schrödinger Propagator Turing Computable?.- A Computable Spectral Theorem.- Report on Competition.- Exact Real Arithmetic Systems: Results of Competition.