Computability and Complexity in Analysis (Record no. 34610)

000 -LEADER
fixed length control field 04938nam a22005535i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540453352
-- 978-3-540-45335-2
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
245 10 - TITLE STATEMENT
Title Computability and Complexity in Analysis
Sub Title 4th International Workshop, CCA 2000 Swansea, UK, September 17–19, 2000 Selected Papers /
Statement of responsibility, etc edited by Jens Blanck, Vasco Brattka, Peter Hertling.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 2001.
300 ## - PHYSICAL DESCRIPTION
Number of Pages VIII, 396 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Global analysis (Mathematics).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logic, Symbolic and mathematical.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Foundations.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Analysis.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Blanck, Jens.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Brattka, Vasco.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hertling, Peter.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-45335-0
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2001.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK5316 http://dx.doi.org/10.1007/3-540-45335-0 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha