Recognizing strong random reals

DOI10.1017/S1755020308080076MaRDI QIDQ3580658zbMATH OpenFDO

Authors Scott Weinstein, Daniel N. Osherson

Publication date 13 August 2010

Published in The Review of Symbolic Logic (Search for Journal in Brave)

zbMATH Keywords

recognizabilityeffective null setstrong random reals

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Recommendations

• Subclasses of the weakly random reals
• Do stronger definitions of randomness exist?
• Randomness in the higher setting
• Randomness via effective descriptive set theory
• The Kolmogorov complexity of random reals

Cites work

• scientific article; zbMATH DE number 4008384 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 3344793 (Why is no real title available?)
• Algorithmic randomness and complexity.
• Calibrating Randomness
• Can an individual sequence of zeros and ones be random?
• Every sequence is reducible to a random one
• Foundations of Cryptography
• Limiting recursion
• Lowness and nullsets
• On degrees of unsolvability
• Process complexity and effective random tests
• Randomness Is Unpredictability
• Stable and Random Motions in Dynamical Systems
• The definition of random sequences
• Trial and error predicates and the solution to a problem of Mostowski
• Weakly computable real numbers

Cited in

(4)

• A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
• A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS
• Initial segment complexities of randomness notions
• Universal coding and prediction on ergodic random points

This page was built for publication: Recognizing strong random reals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580658)