Archive for Mathematical Logic 46 (7-8):533-546 (2008)
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
|
Keywords | Computable analysis Computability Randomness |
Categories | (categorize this paper) |
DOI | 10.1007/s00153-007-0060-4 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
Arithmetical Representations of Brownian Motion I.Willem Fouché - 2000 - Journal of Symbolic Logic 65 (1):421-442.
Citations of this work BETA
On the Kolmogorov Complexity of Continuous Real Functions.Amin Farjudian - 2013 - Annals of Pure and Applied Logic 164 (5):566-576.
Similar books and articles
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Probabilistic Algorithmic Randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
Jump Inversions Inside Effectively Closed Sets and Applications to Randomness.George Barmpalias, Rod Downey & Keng Meng Ng - 2011 - Journal of Symbolic Logic 76 (2):491 - 518.
Uniform Distribution and Algorithmic Randomness.Jeremy Avigad - 2013 - Journal of Symbolic Logic 78 (1):334-344.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
DeFinettian Consensus.L. G. Esteves, S. Wechsler, J. G. Leite & V. A. González-López - 2000 - Theory and Decision 49 (1):79-96.
Every 2-Random Real is Kolmogorov Random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
Randomness Through Computation: Some Answers, More Questions.Hector Zenil (ed.) - 2011 - World Scientific.
Subclasses of the Weakly Random Reals.Johanna N. Y. Franklin - 2010 - Notre Dame Journal of Formal Logic 51 (4):417-426.
A Random Set Which Only Computes Strongly Jump-Traceable C.E. Sets.Noam Greenberg - 2011 - Journal of Symbolic Logic 76 (2):700 - 718.
Randomness and Halting Probabilities.VeróNica Becher, Santiago Figueira, Serge Grigorieff & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1411 - 1430.
Analytics
Added to PP index
2013-11-23
Total views
15 ( #695,068 of 2,499,680 )
Recent downloads (6 months)
1 ( #418,206 of 2,499,680 )
2013-11-23
Total views
15 ( #695,068 of 2,499,680 )
Recent downloads (6 months)
1 ( #418,206 of 2,499,680 )
How can I increase my downloads?
Downloads