101 citations · 491 across the 53 of their papers we have counts for
4 papers · 2 filters
Dividing by zero - how bad is it, really?
Takayuki Kihara, Arno Pauly
In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number w…
On the algebraic structure of Weihrauch degrees
Vasco Brattka, Arno Pauly
We introduce two new operations (compositional products and implication) on Weihrauch degrees, and investigate the overall algebraic structure. The validity of the various distribu…
Computable dyadic subbases and -representations of compact sets
Arno Pauly, Hideki Tsuiki
We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's . We show that computably compact computable metric spaces…
A topological view on algebraic computation models
Eike Neumann, Arno Pauly
We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and c…