Every sequence is reducible to a random one
Information and Control
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Structural complexity 1
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The quantitative structure of exponential time
Complexity theory retrospective II
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
A characterization of c.e. random reals
Theoretical Computer Science
On the Autoreducibility of Random Sequences
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Applications of recursive operators to randomness and complexity
Applications of recursive operators to randomness and complexity
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We give a direct and rather simple construction of Martin-L枚f random and rec-random sets with certain additional properties. First, reviewing the result of G谩cs and Ku驴era, given any set X we construct a Martin-L枚f random set R from which X can be decoded effectively. Second, by essentially the same construction we obtain a Martin-L枚f random set R that is computably enumerable selfreducible. Alternatively, using the observation that a set is computably enumerable selfreducible if and only if its associated real is computably enumerable, the existence of such a set R follows from the known fact that every Chaitin 驴 real is Martin-L枚f random and computably enumerable. Third, by a variant of the basic construction we obtain a rec-random set that is weak truthtable autoreducible.The mentioned results on self- and autoreducibility complement work of Ebert, Merkle, and Vollmer [7,8,9], from which it follows that no Martin-L枚f random set is Turing-autoreducible and that no rec-random set is truth-table autoreducible.