We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces
and study which characterizations hold effectively. Being a computable effectively open …

We present a survey on computability of subsets of Euclidean space and, more generally,
computability concepts on metric spaces and their subsets. In particular, we discuss …

We introduce the point degree spectrum of a represented space as a substructure of the
Medvedev degrees, which integrates the notion of Turing degrees, enumeration degrees …

The enumeration degrees of sets of natural numbers can be identified with the degrees of
difficulty of enumerating neighborhood bases of points in a universal second-countable …

We prove effective versions of some classical results about measurable functions and derive
from this extensions of the Suslin-Kleene theorem, and of the effective Hausdorff theorem for …

We investigate computability theoretic and descriptive set theoretic contents of various kinds
of analytic choice principles by performing a detailed analysis of the Medvedev lattice of …

We explore the low levels of the structure of the continuous Weihrauch degrees of first-order
problems. In particular, we show that there exists a minimal discontinuous first-order degree …

Given some set, how hard is it to construct a measure supported by it? We classify some
variations of this task in the Weihrauch lattice. Particular attention is paid to Frostman …

We survey current stage of effective descriptive set theory which was fast evolving in the last
decade. Most attention will be given to (effective) quasi-Polish spaces and their important …

We show that there exists a positive arithmetical formula $\psi (x, R) $, where $ x\in\omega $,
$ R\subseteq\omega $, with no hyperarithmetical fixed point. This answers a question of …