On the computability of a construction of Brownian motion

DOI10.1017/S0960129513000157zbMath1286.68249OpenAlexW2137323892MaRDI QIDQ5410239

George Davie, Willem L. Fouché

Publication date: 16 April 2014

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

Full work available at URL: https://doi.org/10.1017/s0960129513000157

Mathematics Subject Classification ID

Brownian motion (60J65) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (max. 100)

A domain-theoretic approach to Brownian motion and general continuous stochastic processes ⋮ On zeros of Martin-Löf random Brownian motion ⋮ Unnamed Item ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• Unnamed Item
• 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
• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• 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
• Randomness and the Ergodic Decomposition
• Kolmogorov complexity and strong approximation of Brownian motion
• Algorithmic Randomness and Complexity
• Fractals Generated by Algorithmically Random Brownian Motion
• An Application of Martin-Löf Randomness to Effective Probability Theory
• Arithmetical representations of Brownian motion I
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• The definition of random sequences
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: On the computability of a construction of Brownian motion