Recognizing strong random reals

DOI10.1017/S1755020308080076zbMATH Open1204.03043MaRDI QIDQ3580658FDOQ3580658

Authors: Scott Weinstein, Daniel N. Osherson 

Publication date: 13 August 2010

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

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

zbMATH Keywords

recognizabilityeffective null setstrong random reals

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Cites Work

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

Cited In (4)

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

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)