default search action
4th CCA 2000: Swansea, UK
- Jens Blanck, Vasco Brattka, Peter Hertling:
Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers. Lecture Notes in Computer Science 2064, Springer 2001, ISBN 3-540-42197-1
Computability and Complexity in Analysis
- Jens Blanck:
Effectivity of Regular Spaces. 1-15 - Anthony J. Dunlop, Marian Boykan Pour-El:
The Degree of Unsolvability of a Real Number. 16-29 - Paul Gowland, David R. Lester:
A Survey of Exact Arithmetic Implementations. 30-47 - Armin Hemmerling:
Standard Representations of Effective Metric Spaces. 48-68 - Peter Hertling:
Banach-Mazur Computable Functions on Metric Spaces. 69-81 - Namhyun Hur, James H. Davenport:
A Generic Root Operation for Exact Real Arithmetic. 82-87 - Hiroyasu Kamo:
Effective Contraction Theorem and Its Application. 88-100 - George Kapoulas:
Polynomially Time Computable Functions over p-Adic Fields. 101-118 - Ulrich Kohlenbach:
On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems. 119-145 - Margarita V. Korovina, Oleg V. Kudinov:
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. 146-168 - Marko Krznaric:
Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations. 169-186 - Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna:
delta-Approximable Functions. 187-199 - Takakazu Mori:
Computabilities of Fine-Continuous Functions. 200-221 - Norbert Th. Müller:
The iRRAM: Exact Arithmetic in C++. 222-252 - Daniel Richardson:
The Uniformity Conjecture. 253-272 - Matthias Schröder:
Admissible Representations of Limit Spaces. 273-295 - Dimiter Skordev:
Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions. 296-309 - Izumi Takeuti:
Effective Fixed Point Theorem over a Non-computably Separable Metric Space. 310-322 - Hideki Tsuiki:
Computational Dimension of Topological Spaces. 323-335 - Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori:
Some Properties of the Effective Uniform Topological Space. 336-356 - Klaus Weihrauch:
On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. 357-368 - Klaus Weihrauch, Ning Zhong:
Is the Linear Schrödinger Propagator Turing Computable? 369-377 - Martin Ziegler, Vasco Brattka:
A Computable Spectral Theorem. 378-388
Report on Competition
- Jens Blanck:
Exact Real Arithmetic Systems: Results of Competition. 389-394
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.