Fractals Generated by Algorithmically Random Brownian Motion
A continuous function x on the unit interval is an algorithmically random Brownian motion when every probabilistic event A which holds almost surely with respect to the Wiener measure, is reflected in x, provided A has a suitably effective description. In this paper we study the zero sets and global maxima from the left as well as the images of compact sets of reals of Hausdorff dimension zero under such a Brownian motion. In this way we shall be able to find arithmetical definitions of perfect sets of reals whose elements are linearly independent over the field of recursive real numbers.
Keywordsalgorithmic randomness Brownian motion fractal geometry
Mathematics Subject Classification (2000)03D20 68Q30 60J65 60G05 60G17
Unable to display preview. Download preview PDF.
- 1.Asarin, E.A., Prokovskiy, A.V.: Use of the Kolmogorov complexity in analyzing control system dynamics. Automat. Remote Control 47, 21–28 (1986); Translated from: Primeenenie kolmogorovskoi slozhnosti k anlizu dinamiki upravlemykh sistem. Automatika i Telemekhanika (Automation Remote Control) 1, 25–33 (1986)zbMATHGoogle Scholar
- 11.Peres, Y.: An Invitation to Sample Paths of Brownian Motion, http://www.stat.berkeley.edu/~peres/bmall.pdf