Dynamics of a generic Brownian motion: Recursive aspects

DOI10.1016/J.TCS.2007.12.010MaRDI QIDQ2482459zbMATH OpenOpenAlexFDO

Authors Willem Louw Fouché

Publication date 16 April 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.12.010

zbMATH Keywords

Brownian motioncomplex pointsKolmogorov complexitylaw of iterated logarithm

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Arithmetical representations of Brownian motion I
• Diophantine properties of Brownian motion: recursive aspects
• The descriptive complexity of Brownian motion
• Kolmogorov complexity and the geometry of Brownian motion
• On the computability of a construction of Brownian motion

Cites work

• Arithmetical representations of Brownian motion I
• Brownian local minima, random dense countable sets and random equivalence classes
• Descriptive Complexity and Reflective Properties of Combinatorial Configurations
• How Often on a Brownian Path Does the Law of Iterated Logarithm Fail?
• scientific article; zbMATH DE number 3673243 (Why is no real title available?)
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 517204 (Why is no real title available?)
• scientific article; zbMATH DE number 4119313 (Why is no real title available?)
• scientific article; zbMATH DE number 3433315 (Why is no real title available?)
• scientific article; zbMATH DE number 3366273 (Why is no real title available?)
• Information, randomness and incompleteness. Papers on algorithmic information theory
• Large increments of Brownian motion
• On the Length of Programs for Computing Finite Binary Sequences
• The definition of random sequences
• The descriptive complexity of Brownian motion
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• Universal graphs and universal functions
• Use of the Kolmogorov complexity in analyzing control system dynamics
• Von Mises' definition of random sequences reconsidered

Cited in

(14)

• Effective dimension of points visited by Brownian motion
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Recurrence of multi-dimensional diffusion processes in Brownian environments
• Randomness, computation and mathematics
• On zeros of Martin-Löf random Brownian motion
• Fractals generated by algorithmically random Brownian motion
• Weihrauch-completeness for layerwise computability
• The descriptive complexity of stochastic integration
• Arithmetical representations of Brownian motion I
• Diophantine properties of Brownian motion: recursive aspects
• Computable Measure Theory and Algorithmic Randomness
• On the computability of a construction of Brownian motion
• Kolmogorov complexity and the geometry of Brownian motion
• On local times of Martin-Löf random Brownian motion

This page was built for publication: Dynamics of a generic Brownian motion: Recursive aspects

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