Computability and Complexity in Analysis 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers

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’...

Full description

Bibliographic Details
Other Authors: Blanck, Jens (Editor), Brattka, Vasco (Editor), Hertling, Peter (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2001, 2001
Edition:1st ed. 2001
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 04358nmm a2200409 u 4500
001 EB001884708
003 EBX01000000000000001048075
005 00000000000000.0
007 cr|||||||||||||||||||||
008 191115 ||| eng
020 |a 9783540453352 
100 1 |a Blanck, Jens  |e [editor] 
245 0 0 |a Computability and Complexity in Analysis  |h Elektronische Ressource  |b 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers  |c edited by Jens Blanck, Vasco Brattka, Peter Hertling 
250 |a 1st ed. 2001 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2001, 2001 
300 |a VIII, 396 p  |b online resource 
505 0 |a 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 
653 |a Programming Techniques 
653 |a Computer science 
653 |a Computer programming 
653 |a Mathematical logic 
653 |a Algorithms 
653 |a Formal Languages and Automata Theory 
653 |a Database Management 
653 |a Machine theory 
653 |a Mathematical Logic and Foundations 
653 |a Theory of Computation 
653 |a Database management 
700 1 |a Brattka, Vasco  |e [editor] 
700 1 |a Hertling, Peter  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-45335-0 
856 4 0 |u https://doi.org/10.1007/3-540-45335-0?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.0151 
520 |a 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