Arithmetical representations of Brownian motion I
Willem L. Fouché · Journal of Symbolic Logic · 2000
Abstract We discuss ways in which a typical one-dimensional Brownian motion can be approximated by oscillations which are encoded by finite binary strings of high descriptive complexity. We study the recursive properties of Brownian motions that can be thus obtained.