10 citations · 18 across the 3 of their papers we have counts for
3 papers
cs.LO2022
Left computably enumerable reals and initial segment complexity
George Davie
We are interested in the computability between left c.e. reals and their initial segments. We show that the quantity plays a crucial role in this and in their c…
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.CC2014★ 8 cited
Fourier spectra of measures associated with algorithmically random Brownian motion
Willem Louw Fouché, Safari Mukeru, George Davie
In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion.…