Kolmogorov complexity and the geometry of Brownian motion
Computational Complexity
2019-02-20 v1
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.
Cite
@article{arxiv.1409.1060,
title = {Kolmogorov complexity and the geometry of Brownian motion},
author = {Willem L. Fouche},
journal= {arXiv preprint arXiv:1409.1060},
year = {2019}
}
Comments
Paper accepted by Mathematical Structures in Computer Science