Lowness for the class of random sets
Open Access
- 1 December 1999
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 64 (4) , 1396-1402
- https://doi.org/10.2307/2586785
Abstract
A positive answer to a question of M. van Lambalgen and D. Zambella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Here a set A is low for the class RAND of random sets if RAND = RANDA.Keywords
This publication has 7 references indexed in Scilit:
- On relative randomnessAnnals of Pure and Applied Logic, 1993
- Recursively Enumerable Sets and DegreesPublished by Springer Nature ,1987
- Every sequence is reducible to a random oneInformation and Control, 1986
- Measure, Π 1 0 -classes and complete extensions of PALecture Notes in Mathematics, 1985
- Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 1978
- Subsequences of normal sequencesIsrael Journal of Mathematics, 1973
- The definition of random sequencesInformation and Control, 1966