Fractals generated by algorithmically random brownian motion

10Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A continuous function x on the unit interval is an algorithmically random Brownian motion when every probabilistic event A which holds almost surely with respect to the Wiener measure, is reflected in x, provided A has a suitably effective description. In this paper we study the zero sets and global maxima from the left as well as the images of compact sets of reals of Hausdorff dimension zero under such a Brownian motion. In this way we shall be able to find arithmetical definitions of perfect sets of reals whose elements are linearly independent over the field of recursive real numbers. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fouché, W. L. (2009). Fractals generated by algorithmically random brownian motion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 208–217). https://doi.org/10.1007/978-3-642-03073-4_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free