Arithmetical representations of brownian motion I

Journal of Symbolic Logic 65 (1):421-442 (2000)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
41 (#379,234)

6 months
20 (#125,481)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Willem Fouché
University of South Africa

Citations of this work

On the Kolmogorov complexity of continuous real functions.Amin Farjudian - 2013 - Annals of Pure and Applied Logic 164 (5):566-576.
Algorithmically random series and Brownian motion.Paul Potgieter - 2018 - Annals of Pure and Applied Logic 169 (11):1210-1226.

Add more citations

References found in this work

No references found.

Add more references