RECOGNIZING STRONG RANDOM REALS

DOI10.1017/S1755020308080076zbMath1204.03043MaRDI QIDQ3580658

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)

Related Items (4)

UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS ⋮ Initial segment complexities of randomness notions ⋮ A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE ⋮ A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Process complexity and effective random tests
• On degrees of unsolvability
• Algorithmic Randomness and Complexity
• Stable and Random Motions in Dynamical Systems
• Lowness and nullsets
• Calibrating Randomness
• Can an individual sequence of zeros and ones be random?
• Every sequence is reducible to a random one
• Foundations of Cryptography
• Randomness Is Unpredictability
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• The definition of random sequences
• Weakly computable real numbers

This page was built for publication: RECOGNIZING STRONG RANDOM REALS