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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Blanck, Jens (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Brattka, Vasco (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Hertling, Peter (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2064
• Θέματα: Computers.; Database management.; Computer programming.; Algorithms.; Mathematical logic.; Computation by Abstract Devices.; Database Management.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Mathematical Logic and Formal Languages.; Mathematical Logic and Foundations.

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

Πίνακας περιεχομένων:

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