5 citations · 6 across the 3 of their papers we have counts for
3 papers
math.NA2019
Randomized Computation of Continuous Data: Is Brownian Motion Computable?
Willem Fouché, Hyunwoo Lee, Donghyun Lim +3
We consider randomized computation of continuous data in the sense of Computable Analysis. Our first contribution formally confirms that it is no loss of generality to take as samp…
math.LO2019★ 1 cited
Overt choice
Matthew de Brecht, Arno Pauly, Matthias Schröder
We introduce and study the notion of overt choice for countably-based spaces and for CoPolish spaces. Overt choice is the task of producing a point in a closed set specified by wha…
cs.LO2013★ 5 cited
Some Hierarchies of QCB_0-Spaces
Matthias Schroeder, Victor Selivanov
We define and study hierarchies of topological spaces induced by the classical Borel and Luzin hierarchies of sets. Our hierarchies are divided into two classes: hierarchies of cou…