The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
From MaRDI portal
Publication:5434516
DOI10.1007/978-3-540-72734-7_22zbMATH Open1133.68029OpenAlexW1563885232MaRDI QIDQ5434516FDOQ5434516
Authors: Bjørn Kjos-Hanssen, Anil Nerode 
Publication date: 4 January 2008
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72734-7_22
Recommendations
- Algorithmically random series and Brownian motion
- Effective dimension of points visited by Brownian motion
- Fractals generated by algorithmically random Brownian motion
- The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
- Kolmogorov complexity and strong approximation of Brownian motion
Cited In (15)
- Fourier spectra of measures associated with algorithmically random Brownian motion
- Kolmogorov complexity and strong approximation of Brownian motion
- Algorithmic randomness for Doob's martingale convergence theorem in continuous time
- Random continuum and Brownian motion
- On zeros of Martin-Löf random Brownian motion
- Computable Measure Theory and Algorithmic Randomness
- Dynamics of a generic Brownian motion: Recursive aspects
- Algorithmically random series and Brownian motion
- The descriptive complexity of stochastic integration
- Effective dimension of points visited by Brownian motion
- 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
- Martin-Löf randomness in spaces of closed sets
- Fractals generated by algorithmically random Brownian motion
This page was built for publication: The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434516)
