101 citations · 491 across the 53 of their papers we have counts for
6 papers · 1 filter
Computing Haar Measures
Arno Pauly, Dongseong Seon, Martin Ziegler
According to Haar's Theorem, every compact group admits a unique (regular, right and) left-invariant Borel probability measure . Let the Haar integral (of ) denote the…
Convex choice, finite choice and sorting
Takayuki Kihara, Arno Pauly
We study the Weihrauch degrees of closed choice for finite sets, closed choice for convex sets and sorting infinite sequences over finite alphabets. Our main results are: One, that…
Enumeration degrees and non-metrizable topology
Takayuki Kihara, Keng Meng Ng, Arno Pauly
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 $T_0…
Effective local compactness and the hyperspace of located sets
Arno Pauly
We revisit the definition of effective local compactness, and propose an approach that works for arbitrary countably-based spaces extending the previous work on computable metric s…
Computability Aspects of Differential Games in Euclidian Spaces
Gafurjan Ibragimov, Bakh Khoussainov, Arno Pauly
We study computability-theoretic aspects of differential games. Our focus is on pursuit and evasion games played in Euclidean spaces in the tradition of Rado's "Lion versus Man" ga…
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…