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: 92,227

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Arithmetical representations of brownian motion I.Willem Fouché - 2000 - Journal of Symbolic Logic 65 (1):421-442.
Diophantine properties of brownian motion: recursive aspects.Willem L. Fouché - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 139-156.
Evident atoms: visuality in Jean Perrin’s Brownian motion research.Charlotte Bigg - 2008 - Studies in History and Philosophy of Science Part A 39 (3):312-322.
Short-time stochastic electron.Paul D. Raskin - 1978 - Foundations of Physics 8 (1-2):31-44.
Brownian movement and microscopic irreversibility.L. G. M. Gordon - 1981 - Foundations of Physics 11 (1-2):103-113.
Models, the Brownian motion, and the disunities of physics.R. I. G. Hughes - 1997 - In John Earman & John Norton (eds.), The Cosmos of Science. University of Pittsburgh Press. pp. 325--347.

Analytics

Added to PP
2017-02-21

Downloads
7 (#1,392,075)

6 months
1 (#1,478,781)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Willem Fouché
University of South Africa

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references