RECOGNIZING STRONG RANDOM REALS
From MaRDI portal
Publication:3580658
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)
03D32: Algorithmic randomness and dimension
Related Items
UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS, 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
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