Computability and Complexity in Analysis 4th International Workshop, CCA 2000 Swansea, UK, September 17–19, 2000 Selected Papers / [electronic resource] :
edited by Jens Blanck, Vasco Brattka, Peter Hertling.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2001.
- VIII, 396 p. online resource.
- Lecture Notes in Computer Science, 2064 0302-9743 ; .
- Lecture Notes in Computer Science, 2064 .
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.
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
9783540453352
10.1007/3-540-45335-0 doi
Computer science.
Computer software.
Global analysis (Mathematics).
Logic, Symbolic and mathematical.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Mathematical Logic and Formal Languages.
Mathematical Logic and Foundations.
Analysis.
QA75.5-76.95
004.0151
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.
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
9783540453352
10.1007/3-540-45335-0 doi
Computer science.
Computer software.
Global analysis (Mathematics).
Logic, Symbolic and mathematical.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Mathematical Logic and Formal Languages.
Mathematical Logic and Foundations.
Analysis.
QA75.5-76.95
004.0151