Algorithmic randomness of continuous functions

Archive for Mathematical Logic 46 (7-8):533-546 (2008)
  Copy   BIBTEX

Abstract

We investigate notions of randomness in the space ${{\mathcal C}(2^{\mathbb N})}$ of continuous functions on ${2^{\mathbb N}}$ . A probability measure is given and a version of the Martin-Löf test for randomness is defined. Random ${\Delta^0_2}$ continuous functions exist, but no computable function can be random and no random function can map a computable real to a computable real. The image of a random continuous function is always a perfect set and hence uncountable. For any ${y \in 2^{\mathbb N}}$ , there exists a random continuous function F with y in the image of F. Thus the image of a random continuous function need not be a random closed set. The set of zeroes of a random continuous function is always a random closed set

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,459

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

Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.
Continuous higher randomness.Laurent Bienvenu, Noam Greenberg & Benoit Monin - 2017 - Journal of Mathematical Logic 17 (1):1750004.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
Randomness notions and reverse mathematics.André Nies & Paul Shafer - 2020 - Journal of Symbolic Logic 85 (1):271-299.
Effectively closed sets of measures and randomness.Jan Reimann - 2008 - Annals of Pure and Applied Logic 156 (1):170-182.

Analytics

Added to PP
2013-11-23

Downloads
38 (#476,099)

6 months
8 (#462,840)

Historical graph of downloads
How can I increase my downloads?

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.

Add more citations

References found in this work

Arithmetical representations of brownian motion I.Willem Fouche - 2000 - Journal of Symbolic Logic 65 (1):421-442.

Add more references