On the computability of a construction of Brownian motion

DOI10.1017/S0960129513000157zbMATH Open1286.68249OpenAlexW2137323892MaRDI QIDQ5410239FDOQ5410239

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

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

Mathematics Subject Classification ID

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

Cites Work

• Algorithmic randomness and complexity.
• A formal theory of inductive inference. Part I
• Dynamics of a generic Brownian motion: Recursive aspects
• Title not available (Why is that?)
• The definition of random sequences
• A formal theory of inductive inference. Part II
• Computability of probability measures and Martin-Löf randomness over metric spaces
• An introduction to Kolmogorov complexity and its applications
• The descriptive complexity of Brownian motion
• An application of Martin-Löf randomness to effective probability theory
• Uniform test of algorithmic randomness over a general space
• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• 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
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• Computability on the probability measures on the Borel sets of the unit interval
• Randomness and the ergodic decomposition

Cited In (11)

• Fourier spectra of measures associated with algorithmically random Brownian motion
• Title not available (Why is that?)
• Kolmogorov complexity and strong approximation of Brownian motion
• 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
• Dynamics of a generic Brownian motion: Recursive aspects
• Algorithmically random series and Brownian motion
• 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)