Journal of Symbolic Logic · 2000 · 45 citations · 10 references
EngineeringComputer ScienceMathematicsProbability TheoryRepresentation TheoryStochastic ProcessesBrownian MotionContinuous-time Stochastic ProcessesDiffusion ProcessesMarkov ProcessesRandom WalksStochastic CalculusBrownian Motion AnalysisBrownian Motion ApproximationsDescriptive Complexity Of POscillation Of Arithmetic FunctionsStandard Brownian Motion
Abstract We 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.
10
PE, P. Billingsley · Journal of the American Statistical Association · 1996 · 6.7K citations
The definition of random sequences
Per Martin-Löf · Information and Control · 1966 · 1.2K citations
Algorithmic Information Theory
Gregory J. Chaitin · IBM Journal of Research and Development · 1977 · 1K citations
On the Length of Programs for Computing Finite Binary Sequences
Gregory J. Chaitin · Journal of the ACM · 1969 · 917 citations · Full text
On the Length of Programs for Computing Finite Binary Sequences
Gregory J. Chaitin · Journal of the ACM · 1966 · 912 citations · Full text