Kolmogorov complexity and the geometry of Brownian motion

Abstract

In this paper, we continue the study of the geometry of Brownian motions which are encoded by Kolmogorov-Chaitin random reals (complex oscillations). We unfold Kolmogorov-Chaitin complexity in the context of Brownian motion and specifically to phenomena emerging from the random geometric patterns generated by a Brownian motion.

arXiv commentPaper accepted by Mathematical Structures in Computer Science

References in corpus (3)

• Nonclassical stochastic flows and continuous products
• Effective dimension of points visited by Brownian motion
• Kolmogorov complexity and strong approximation of Brownian motion

Cited by in corpus (1)

• Polynomial Time Computable Triangular Arrays For Almost Sure Convergence