Kolmogorov complexity and the geometry of Brownian motion

DOI10.1017/S0960129513000273zbMATH Open1361.68110arXiv1409.1060MaRDI QIDQ5740672FDOQ5740672

Authors: Willem Louw Fouché 

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1409.1060

Recommendations

• Kolmogorov complexity and strong approximation of Brownian motion
• Kolmogorov complexity in perspective. I: Information theory and randomness
• Dynamics of a generic Brownian motion: Recursive aspects
• Arithmetical representations of Brownian motion I
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion

Mathematics Subject Classification ID

Brownian motion (60J65) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Dynamics of a generic Brownian motion: Recursive aspects
• Algorithmic Information Theory
• Title not available (Why is that?)
• The definition of random sequences
• Computability of probability measures and Martin-Löf randomness over metric spaces
• The descriptive complexity of Brownian motion
• Title not available (Why is that?)
• Uniform test of algorithmic randomness over a general space
• New Directions in Descriptive Set Theory
• Effective dimension of points visited by Brownian motion
• Kolmogorov complexity and strong approximation of Brownian motion
• Fractals generated by algorithmically random Brownian motion
• Arithmetical representations of Brownian motion I
• Nonclassical stochastic flows and continuous products
• Computability on the probability measures on the Borel sets of the unit interval
• Brownian local minima, random dense countable sets and random equivalence classes

Cited In (7)

• Kolmogorov complexity and strong approximation of Brownian motion
• Polynomial time relatively computable triangular arrays for almost sure convergence
• The descriptive complexity of Brownian motion
• Computable Measure Theory and Algorithmic Randomness
• Dynamics of a generic Brownian motion: Recursive aspects
• From Gauss to Kolmogorov: localized measures of complexity for ellipses
• Information geometric characterization of the complexity of fractional Brownian motions

This page was built for publication: Kolmogorov complexity and the geometry of Brownian motion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740672)