Kolmogorov complexity and the geometry of Brownian motion

DOI10.1017/S0960129513000273zbMath1361.68110arXiv1409.1060MaRDI QIDQ5740672

Willem L. Fouché

Publication date: 27 July 2016

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

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

Mathematics Subject Classification ID

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

Related Items (2)

Polynomial time relatively computable triangular arrays for almost sure convergence ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

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

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