Fractals Generated by Algorithmically Random Brownian Motion
From MaRDI portal
Publication:3576053
DOI10.1007/978-3-642-03073-4_22zbMath1268.03054OpenAlexW1804986499MaRDI QIDQ3576053
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_22
Fractals (28A80) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
Related Items (5)
On local times of Martin-Löf random Brownian motion ⋮ The descriptive complexity of stochastic integration ⋮ On the computability of a construction of Brownian motion ⋮ Kolmogorov complexity and the geometry of Brownian motion ⋮ Computable Measure Theory and Algorithmic Randomness
Cites Work
- Unnamed Item
- Unnamed Item
- The descriptive complexity of Brownian motion
- Dynamics of a generic Brownian motion: Recursive aspects
- Algorithmic Information Theory
- Arithmetical representations of Brownian motion I
- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
- The definition of random sequences
This page was built for publication: Fractals Generated by Algorithmically Random Brownian Motion