On the Autoreducibility of Random Sequences
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the Construction of Effective Random Sets
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A topological characterization of random sequences
Information Processing Letters
Every sequence is decompressible from a random one
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Randomness, computation and mathematics
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Initial segment complexities of randomness notions
Information and Computation
Hi-index | 0.00 |