Arithmetical representations of Brownian motion I

DOI10.2307/2586546zbMath0944.60087OpenAlexW2169990656MaRDI QIDQ4953229

Willem L. Fouché

Publication date: 9 May 2000

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586546

Mathematics Subject Classification ID

Brownian motion (60J65) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of computability and recursion theory (03D80)

Related Items

Computability of probability measures and Martin-Löf randomness over metric spaces ⋮ A domain-theoretic approach to Brownian motion and general continuous stochastic processes ⋮ On zeros of Martin-Löf random Brownian motion ⋮ On local times of Martin-Löf random Brownian motion ⋮ The Khinchin inequality for multiple sums revisited ⋮ Algorithmic randomness of continuous functions ⋮ The descriptive complexity of stochastic integration ⋮ On the computability of a construction of Brownian motion ⋮ Fractals Generated by Algorithmically Random Brownian Motion ⋮ Dynamics of a generic Brownian motion: Recursive aspects ⋮ Random Continuous Functions ⋮ Kolmogorov complexity and the geometry of Brownian motion ⋮ Zeno machines and hypercomputation ⋮ Algorithmically random series and Brownian motion ⋮ Effective dimension of points visited by Brownian motion ⋮ Kolmogorov complexity and strong approximation of Brownian motion ⋮ The descriptive complexity of Brownian motion ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• Descriptive Complexity and Reflective Properties of Combinatorial Configurations
• On the Length of Programs for Computing Finite Binary Sequences
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Arithmetical representations of Brownian motion I