Total Representations

Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and representations closer, unify some terminology, simplify some technical details, suggest interesting open questions and new invariants of topological spaces relevant to computable analysis.Comment: 30 page

Lipschitz and uniformly continuous reducibilities on ultrametric Polish spaces

We analyze the reducibilities induced by, respectively, uniformly continuous, Lipschitz, and nonexpansive functions on arbitrary ultrametric Polish spaces, and determine whether under suitable set-theoretical assumptions the induced degree-structures are well-behaved.Comment: 37 pages, 2 figures, revised version, accepted for publication in the Festschrift that will be published on the occasion of Victor Selivanov's 60th birthday by Ontos-Verlag. A mistake has been corrected in Section

Wadge-like reducibilities on arbitrary quasi-Polish spaces

The structure of the Wadge degrees on zero-dimensional spaces is very simple (almost well-ordered), but for many other natural non-zero-dimensional spaces (including the space of reals) this structure is much more complicated. We consider weaker notions of reducibility, including the so-called \Delta^0_\alpha-reductions, and try to find for various natural topological spaces X the least ordinal \alpha_X such that for every \alpha_X \leq \beta < \omega_1 the degree-structure induced on X by the \Delta^0_\beta-reductions is simple (i.e. similar to the Wadge hierarchy on the Baire space). We show that \alpha_X \leq {\omega} for every quasi-Polish space X, that \alpha_X \leq 3 for quasi-Polish spaces of dimension different from \infty, and that this last bound is in fact optimal for many (quasi-)Polish spaces, including the real line and its powers.Comment: 50 pages, revised version, accepted for publication on Mathematical Structures in Computer Scienc

Advances and applications of automata on words and trees : abstracts collection

From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501 "Advances and Applications of Automata on Words and Trees" was held in Schloss Dagstuhl - Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available