101 citations · 491 across the 53 of their papers we have counts for
Showing 2015 · cs.LOShow all
3 papers · 2 filters
cs.LO2015
Comparing representations for function spaces in computable analysis
Arno Pauly, Florian Steinberg
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace represen…
cs.LO2015★ 10 cited
Weihrauch-completeness for layerwise computability
Arno Pauly, Willem Fouché, George Davie
We introduce the notion of being Weihrauch-complete for layerwise computability and provide several natural examples related to complex oscillations, the law of the iterated logari…
cs.LO2015★ 2 cited
Computability on the space of countable ordinals
Arno Pauly
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention…