101 citations · 491 across the 53 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.LO2011★ 1 cited
Relative Computability and Uniform Continuity of Relations
Arno Pauly, Martin Ziegler
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theore…
cs.CC2011★ 9 cited
Many-one reductions and the category of multivalued functions
Arno Pauly
Multi-valued functions are common in computable analysis (built upon the Type 2 Theory of Effectivity), and have made an appearance in complexity theory under the moniker search pr…
cs.LO2011★ 41 cited
The degree structure of Weihrauch-reducibility
Kojiro Higuchi, Arno Pauly
We answer a question by Vasco Brattka and Guido Gherardi by proving that the Weihrauch-lattice is not a Brouwer algebra. The computable Weihrauch-lattice is also not a Heyting alge…