Computability and complexity in analysis. 4th international workshop, CCA 2000. Swansea, GB, September 17--19, 2000. Selected papers (Q5941724)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Blanck, Jens}, Effectivity of regular spaces, 1-15 [Zbl 0985.03032] \textit{Dunlop, Anthony J.; Pour-El, Marian Boykan}, The degree of unsolvability of a real number, 16-29 [Zbl 0985.03027] \textit{Gowland, Paul; Lester, David}, A survey of exact arithmetic implementations, 30-47 [Zbl 0985.65043] \textit{Hemmerling, Armin}, Standard representations of effective metric spaces, 48-68 [Zbl 0985.03035] \textit{Hertling, Peter}, Banach-Mazur computable functions on metric spaces, 69-81 [Zbl 0985.03055] \textit{Hur, Namhyun; Davenport, James H.}, A generic root operation for exact real arithmetic, 82-87 [Zbl 0985.65042] \textit{Kamo, Hiroyasu}, Effective contraction theorem and its application, 88-100 [Zbl 0985.03030] \textit{Kapoulas, George}, Polynomially time computable functions over \(p\)-adic fields, 101-118 [Zbl 0985.03026] \textit{Kohlenbach, Ulrich}, On the computational content of the Krasnoselski and Ishikawa fixed point theorems, 119-145 [Zbl 0985.03048] \textit{Korovina, Margarita V.; Kudinov, Oleg V.}, Formalisation of computability of operators and real-valued functionals via domain theory, 146-168 [Zbl 0985.03060] \textit{Krznari, Marko}, Computing a required absolute precision from a stream of linear fractional transformations, 169-186 [Zbl 0985.65044] \textit{Meyssonnier, Charles; Boldi, Paolo; Vigna, Sebastiano}, \(\delta\)-approximable functions, 187-199 [Zbl 0985.03057] \textit{Mori, Takakazu}, Computabilities of Fine-continuous functions, 200-221 [Zbl 0985.03056] \textit{Müller, Norbert Th.}, The iRRAM: Exact arithmetic in C++, 222-252 [Zbl 0985.65523] \textit{Richardson, Daniel}, The uniformity conjecture, 253-272 [Zbl 0986.68169] \textit{Schröder, Matthias}, Admissible representations of limit spaces, 273-295 [Zbl 0985.03028] \textit{Skordev, Dimiter}, Characterization of the computable real numbers by means of primitive recursive functions, 296-309 [Zbl 0985.03059] \textit{Takeuti, Izumi}, Effective fixed point theorem over a non-computably separable metric space, 310-322 [Zbl 0985.03031] \textit{Tsuiki, Hideki}, Computational dimension of topological spaces, 323-335 [Zbl 0985.03029] \textit{Tsujii, Yoshiki; Yasugi, Mariko; Mori, Takakazu}, Some properties of the effective uniform topological space, 336-356 [Zbl 0985.03034] \textit{Weihrauch, Klaus}, On computable metric spaces Tietze-Urysohn extension is computable, 357-368 [Zbl 0985.03033] \textit{Weihrauch, Klaus; Zhong, Ning}, Is the linear Schrödinger propagator Turing computable?, 369-377 [Zbl 0985.03058] \textit{Ziegler, Martin; Brattka, Vasco}, A computable spectral theorem, 378-388 [Zbl 0985.03054] \textit{Blanck, Jens}, Exact real arithmetic systems: Results of competition, 389-393 [Zbl 0985.65522]