The descriptive complexity of Brownian motion
From MaRDI portal
Publication:1590058
DOI10.1006/aima.2000.1945zbMath0971.68077OpenAlexW1964724368MaRDI QIDQ1590058
Publication date: 30 October 2001
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aima.2000.1945
Related Items
Energy randomness, When does randomness come from randomness?, Randomness, Computation and Mathematics, 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 descriptive complexity of stochastic integration, On the computability of a construction of Brownian motion, Algorithmic randomness and Fourier analysis, Fractals Generated by Algorithmically Random Brownian Motion, Dynamics of a generic Brownian motion: Recursive aspects, Kolmogorov complexity and the geometry of Brownian motion, Algorithmically random series and Brownian motion, Effective dimension of points visited by Brownian motion, NONSTANDARD ANALYSIS, FRACTAL PROPERTIES AND BROWNIAN MOTION, Kolmogorov complexity and strong approximation of Brownian motion, Polynomial time relatively computable triangular arrays for almost sure convergence, MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS, Unnamed Item, Computable Measure Theory and Algorithmic Randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetries and Ramsey properties of trees
- Von Mises' definition of random sequences reconsidered
- Algorithmic Information Theory
- Descriptive Complexity and Reflective Properties of Combinatorial Configurations
- Arithmetical representations of Brownian motion I
- Algebraic integration theory
- On the Length of Programs for Computing Finite Binary Sequences
- Rigorous quantum field theory models
- The definition of random sequences
