LEADER 06138nam 22007935 450 001 9910143602303321 005 20200704041920.0 010 $a3-540-45335-0 024 7 $a10.1007/3-540-45335-0 035 $a(CKB)1000000000211417 035 $a(SSID)ssj0000322005 035 $a(PQKBManifestationID)11250735 035 $a(PQKBTitleCode)TC0000322005 035 $a(PQKBWorkID)10280223 035 $a(PQKB)10928071 035 $a(DE-He213)978-3-540-45335-2 035 $a(MiAaPQ)EBC3072317 035 $a(PPN)155217933 035 $a(EXLCZ)991000000000211417 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputability and Complexity in Analysis $e4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers /$fedited by Jens Blanck, Vasco Brattka, Peter Hertling 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (VIII, 396 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2064 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42197-1 320 $aIncludes bibliographical references and index. 327 $aComputability 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. 330 $aThe 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2064 606 $aComputers 606 $aDatabase management 606 $aComputer programming 606 $aAlgorithms 606 $aMathematical logic 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aComputers. 615 0$aDatabase management. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aMathematical logic. 615 14$aComputation by Abstract Devices. 615 24$aDatabase Management. 615 24$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aMathematical Logic and Formal Languages. 615 24$aMathematical Logic and Foundations. 676 $a515 702 $aBlanck$b Jens$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBrattka$b Vasco$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHertling$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143602303321 996 $aComputability and Complexity in Analysis$92165836 997 $aUNINA