Author:
DAVIE GEORGE,FOUCHÉ WILLEM L.
Abstract
We examine a construction due to Fouché in which a Brownian motion is constructed from an algorithmically random infinite binary sequence. We show that although the construction is provably not computable in the sense of computable analysis, a lower bound for the rate of convergence is computable in any upper bound for the compressibilty of the sequence, making the construction layerwise computable.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference29 articles.
1. A formal theory of inductive inference. Part I
2. The definition of random sequences
3. An Introduction to Kolmogorov Complexity and Its Applications
4. Laws of information conservation (non-growth) and aspects of the foundation of probability theory.;Levin;Problems of Information Transmission,1974
5. Three approaches to the quantitative definition of information.;Kolmogorov;Problems of Information Transmission,1965
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. WEIHRAUCH-COMPLETENESS FOR LAYERWISE COMPUTABILITY;LOG METH COMPUT SCI;2018
2. A domain-theoretic approach to Brownian motion and general continuous stochastic processes;Theoretical Computer Science;2017-08
3. On zeros of Martin-Löf random Brownian motion;Journal of Logic and Analysis;2015
4. Kolmogorov complexity and the geometry of Brownian motion;Mathematical Structures in Computer Science;2014-11-10
5. A domain-theoretic approach to Brownian motion and general continuous stochastic processes;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14