10 citations · 29 across the 12 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
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.LO2014★ 5 cited
How constructive is constructing measures?
Arno Pauly, Willem L. Fouché
Given some set, how hard is it to construct a measure supported by it? We classify some variations of this task in the Weihrauch lattice. Particular attention is paid to Frostman m…
cs.LO2014
Diophantine properties of Brownian motion: recursive aspects
Willem L. Fouche
We use recent results on the Fourier analysis of the zero sets of Brownian motion to explore the diophantine properties of an algorithmically random Brownian motion (also known as…