Authors: 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. We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff dimensions of these sets, optimal asymptotic decay at infinity.
The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the prefix free Kolmogorov complexity of finite binary sequences. The study also necessitates a closer look at the potential theory over fractals from a computable point of view.

Comment: 24 pages

• 28A78 - Hausdorff and packing measures
• 60G15 - Gaussian processes
• 68Q30 - Algorithmic information theory (Kolmogorov complexity, etc.)