The Resource Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.)
Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.)
Resource Information
The item Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 This book constitutes the thoroughly refereed postproceedings 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 crosssection on current research on computability and complexity in analysis
 Language
 eng
 Extent
 1 online resource (viii, 393 pages)
 Contents

 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
 BanachMazur Computable Functions on Metric Spaces
 A Generic Root Operation for Exact Real Arithmetic
 Effective Contraction Theorem and Its Application
 Polynomially Time Computable Functions over pAdic Fields
 On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems
 Formalisation of Computability of Operators and RealValued Functionals via Domain Theory
 Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations ?Approximable Functions
 Computabilities of FineContinuous 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 NonComputably Separable Metric Space
 Computational Dimension of Topological Spaces
 Some Properties of the Effective Uniform Topological Space
 On Computable Metric Spaces TietzeUrysohn 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
 Isbn
 9783540453352
 Label
 Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers
 Title
 Computability and complexity in analysis
 Title remainder
 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers
 Statement of responsibility
 Jens Blanck, Vasco Brattka, Peter Hertling (eds.)
 Subject

 Computable functions
 Computable functions
 Computable functions  Congresses
 Computational complexity
 Computational complexity
 Computational complexity  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Mathematical analysis
 Mathematical analysis
 Mathematical analysis  Congresses
 Language
 eng
 Summary
 This book constitutes the thoroughly refereed postproceedings 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 crosssection on current research on computability and complexity in analysis
 Cataloging source
 COO
 Dewey number
 515
 Illustrations
 illustrations
 Index
 index present
 Language note
 English
 LC call number
 QA299.6
 LC item number
 .C6585 2001
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate

 1966
 1966
 1965
 http://library.link/vocab/relatedWorkOrContributorName

 Blanck, Jens
 Brattka, Vasco
 Hertling, Peter
 Series statement
 Lecture notes in computer science
 Series volume
 2064
 http://library.link/vocab/subjectName

 Mathematical analysis
 Computable functions
 Computational complexity
 Computable functions
 Computational complexity
 Mathematical analysis
 Label
 Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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  BanachMazur Computable Functions on Metric Spaces  A Generic Root Operation for Exact Real Arithmetic  Effective Contraction Theorem and Its Application  Polynomially Time Computable Functions over pAdic Fields  On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems  Formalisation of Computability of Operators and RealValued Functionals via Domain Theory  Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations ?Approximable Functions  Computabilities of FineContinuous 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 NonComputably Separable Metric Space  Computational Dimension of Topological Spaces  Some Properties of the Effective Uniform Topological Space  On Computable Metric Spaces TietzeUrysohn 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
 Control code
 48948555
 Dimensions
 unknown
 Extent
 1 online resource (viii, 393 pages)
 Form of item
 online
 Isbn
 9783540453352
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540453350
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)48948555
 Label
 Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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  BanachMazur Computable Functions on Metric Spaces  A Generic Root Operation for Exact Real Arithmetic  Effective Contraction Theorem and Its Application  Polynomially Time Computable Functions over pAdic Fields  On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems  Formalisation of Computability of Operators and RealValued Functionals via Domain Theory  Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations ?Approximable Functions  Computabilities of FineContinuous 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 NonComputably Separable Metric Space  Computational Dimension of Topological Spaces  Some Properties of the Effective Uniform Topological Space  On Computable Metric Spaces TietzeUrysohn 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
 Control code
 48948555
 Dimensions
 unknown
 Extent
 1 online resource (viii, 393 pages)
 Form of item
 online
 Isbn
 9783540453352
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540453350
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)48948555
Subject
 Computable functions
 Computable functions
 Computable functions  Congresses
 Computational complexity
 Computational complexity
 Computational complexity  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Mathematical analysis
 Mathematical analysis
 Mathematical analysis  Congresses
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computabilityandcomplexityinanalysis4th/yakt6WyO4uU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computabilityandcomplexityinanalysis4th/yakt6WyO4uU/">Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computabilityandcomplexityinanalysis4th/yakt6WyO4uU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computabilityandcomplexityinanalysis4th/yakt6WyO4uU/">Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 1719, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>