000 05295nam a22006495i 4500
001 978-3-540-45335-2
003 DE-He213
005 20240423132439.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540453352
_9978-3-540-45335-2
024 7 _a10.1007/3-540-45335-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputability and Complexity in Analysis
_h[electronic resource] :
_b4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers /
_cedited by Jens Blanck, Vasco Brattka, Peter Hertling.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aVIII, 396 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2064
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aDatabase management.
650 0 _aComputer programming.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 0 _aMathematical logic.
650 1 4 _aTheory of Computation.
650 2 4 _aDatabase Management.
650 2 4 _aProgramming Techniques.
650 2 4 _aAlgorithms.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aBlanck, Jens.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aBrattka, Vasco.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHertling, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540421979
776 0 8 _iPrinted edition:
_z9783662193310
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2064
856 4 0 _uhttps://doi.org/10.1007/3-540-45335-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187851
_d187851