Dynamics of a generic Brownian motion: Recursive aspects

Authors:
Willem L. Fouché
Affiliations:
Department of Decision Sciences, University of South Africa, PO Box 392, UNISA, 0003, Pretoria, South Africa
Venue:
Theoretical Computer Science
Year:
2008

Citing 4
Cited 6

Algorithmic information theory

Algorithmic information theory
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
On the Length of Programs for Computing Finite Binary Sequences

Journal of the ACM (JACM)
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science

The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Effective dimension of points visited by Brownian motion

Theoretical Computer Science
Computability of probability measures and Martin-Löf randomness over metric spaces

Information and Computation
Applications of Effective Probability Theory to Martin-Löf Randomness

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Fractals Generated by Algorithmically Random Brownian Motion

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Randomness, computation and mathematics

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the local fluctuations of Brownian motions which are represented by infinite binary strings which are random in the sense of Kolmogorov-Chaitin. We show how the dynamical properties of such a Brownian motion at a point depend on its recursive properties.