Abstract
AbstractWe discuss ways in which a typical one-dimensional Brownian motion can be approximated by oscillations which are encoded by finite binary strings of high descriptive complexity. We study the recursive properties of Brownian motions that can be thus obtained.
Publisher
Cambridge University Press (CUP)
Reference22 articles.
1. Connections between different algorithmic definitions of randomness;Shen;Soviet Math. Dokl.,1989
2. Three approaches to the quantitative definition of randomness;Kolmogorov;Problems of Information Transmission,1965
3. �ber das Gesetz des iterierten Logarithmus
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献