The workshop was partially funded by the Faculty of Mathematics and Physics at the University of Ljubljana, the Institute for Mathematics, Physics and Mechanics, as well as the European Union. It was the fourth in a series of workshops aimed at bringing together researchers from exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and rela...

Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approa...

Context-free tree grammars, originally introduced by Rounds ((Rounds, 1970)), are powerful grammar devices for the definition of tree languages. In the present paper, we consider a subclass of the class of context-free tree languages, namely the class of monadic simple context-free tree languages. For this class of context-free tree languages, a faithful rendering of extended TAGs, we show that...

For tabled Lindenmayer systems and their languages, the degree of synchronization and the degree of nondeterminism are well investigated measures of descriptional complexity. In this paper the sequential counterparts of tabled Lindenmayer systems, namely cooperating distributed grammar systems and their pure variant (working in the so called t-mode of derivation) are treated with respect to the...

Decision tree pruning is critical for the construction of good decision trees. The most popular and widely used method among various pruning methods is cost-complexity pruning, whose implementation requires a training dataset to develop a full tree and a validation dataset to prune the tree. However, different pruned trees are found to be produced when the original dataset are randomly partitio...

Using ideas and results from recursion theory and effective descriptive set theory we provide a partial answer to the Decomposabilty Conjecture in Polish spaces of small inductive dimension. The latter extends earlier work of Motto Ros and Pawlikowski-Sabok. We also state a conjecture, which would allow our arguments to be carried out in all Polish spaces, and we give the analogous results in t...

Hiermit versichere ich, daa ich die Arbeit selbstt andig verfaat und keine anderen als die angegebenen Quellen und Hilfsmittel benutzt sowie Zitate kenntlich gemacht habe. I have many people to thank and acknowledge. Especially I would like to thank my advisor, Eric Rosen, for all the time he spent in supporting my thesis work.