Access the full text.
Sign up today, get DeepDyve free for 14 days.
Algorithmic Randomness and Complexity, in preparation. Current draft available at http
(2006)
Random closed sets, in Logical Approaches to Computational Barriers
(1974)
On the symmetry of algorithmic information
A. Nies (2009)
Computability and randomness
Classes, ASL Lecture Notes in Logic
Computability and Randomness, in prepara tion. Current draft available at http
Steven Kautz (1991)
Degrees of random sets
(2006)
Random continuous functions, in CCA
J. Doob (1938)
Review: P. Lévy, Théorie de l'Addition des Variables AléatoiresBulletin of the American Mathematical Society, 44
Five Lectures on Algorithmic Randomness, in Computational Prospects of Infinity
Paul Brodhead, D. Cenzer, S. Dashti (2006)
Random Closed Sets
(1919)
Grundlagen der Wahrscheinlichkeitsrechnung, Math. Zeitschrift
R. Downey (2008)
FIVE LECTURES ON ALGORITHMIC RANDOMNESS
(1974)
On the symmetry of algorithmic information, Soviet Mat
George Barmpalias, Paul Brodhead, D. Cenzer, S. Dashti, Rebecca Weber (2007)
Algorithmic Randomness of Closed SetsJ. Log. Comput., 17
G. Chaitin (1976)
Information-Theoretic Characterizations of Recursive Infinite StringsTheor. Comput. Sci., 2
W. Fitch (1983)
Random sequences.Journal of molecular biology, 163 2
(2006)
Random continuous functions, in CCA 2006, Third International Conference on Computability and Complexity in Analysis
Ming Li, P. Vitányi (1993)
An Introduction to Kolmogorov Complexity and Its Applications
(1981)
Randomness and Genericity in the Degrees of Unsoluvability
(1965)
Three approaches to the quantitative defintion of information, in Problems
Jean-Luc Ville (1939)
Étude critique de la notion de collectif, 218
A.N. Kolmogorov (1965)
Three approaches to the quantitative defintion of informationProblems Inform. Trans., 1
W. Gasarch (1997)
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series))ACM SIGACT News, 28
(1973)
On the notion of a random sequence, Soviet Mat
(1986)
Application of Kolmogorov complexity to the dynamics of controllable systems
H. Chernoff (1952)
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsAnnals of Mathematical Statistics, 23
W. Fouché (2000)
Arithmetical representations of Brownian motion IJournal of Symbolic Logic, 65
Paul Brodhead, D. Cenzer, J. Remmel (2006)
Random Continuous Functions
R. Downey, D. Hirschfeldt, A. Nies, F. Stephan (2002)
Trivial Reals
A. Beckmann, B. Löwe, D. Normann (2007)
Logical Approaches to Computational Barriers: CiE 2006J. Log. Comput., 17
Algorithmic Randomness and Complexity , in preparation
A. Kolmogorov (1968)
Three approaches to the quantitative definition of informationInternational Journal of Computer Mathematics, 2
P. Levy (1955)
Théorie de l'addition des variables aléatoiresThe Mathematical Gazette, 39
P. Martin-Löf (1966)
The Definition of Random SequencesInf. Control., 9
R. Mises (1919)
Grundlagen der WahrscheinlichkeitsrechnungMathematische Zeitschrift, 5
I︠U︡riĭ Ershov (1998)
Recursive algebra, analysis and combinatorics
C. Schnorr (1971)
A unified approach to the definition of random sequencesMathematical systems theory, 5
(1973)
On the notion of a random sequence
A. Muchnik, Alexei Semenov, V. Uspensky (1998)
Mathematical Metaphysics of RandomnessTheor. Comput. Sci., 207
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.
Archive for Mathematical Logic – Springer Journals
Published: Jan 4, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.