On the computability of a construction of Brownian motion

DOI10.1017/S0960129513000157MaRDI QIDQ5410239zbMATH OpenOpenAlexFDO

Authors George Davie, Willem Louw 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)

Recommendations

• Algorithmically random series and Brownian motion
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• scientific article; zbMATH DE number 2046067
• Fractals generated by algorithmically random Brownian motion
• Arithmetical representations of Brownian motion I

Cites work

• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• Algorithmic randomness and complexity.
• An application of Martin-Löf randomness to effective probability theory
• An introduction to Kolmogorov complexity and its applications
• Arithmetical representations of Brownian motion I
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Computability on the probability measures on the Borel sets of the unit interval
• Dynamics of a generic Brownian motion: Recursive aspects
• Effective dimension of points visited by Brownian motion
• Fractals generated by algorithmically random Brownian motion
• Kolmogorov complexity and strong approximation of Brownian motion
• Randomness and the ergodic decomposition
• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• The definition of random sequences
• The descriptive complexity of Brownian motion
• Uniform test of algorithmic randomness over a general space

Cited in

(11)

• Fourier spectra of measures associated with algorithmically random Brownian motion
• Kolmogorov complexity and strong approximation of Brownian motion
• scientific article; zbMATH DE number 2046067 (Why is no real title available?)
• Weihrauch-completeness for layerwise computability
• On zeros of Martin-Löf random Brownian motion
• The descriptive complexity of Brownian motion
• Computable Measure Theory and Algorithmic Randomness
• Algorithmically random series and Brownian motion
• Dynamics of a generic Brownian motion: Recursive aspects
• A domain-theoretic approach to Brownian motion and general continuous stochastic processes
• A domain-theoretic approach to Brownian motion and general continuous stochastic processes

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

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