Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Incompleteness theorems for random reals
Advances in Applied Mathematics
Algorithmic information theory
Algorithmic information theory
On the continued fraction representation of computable real numbers
Theoretical Computer Science
Information randomness & incompleteness: papers on algorithmic information theory (2nd ed.)
Information randomness & incompleteness: papers on algorithmic information theory (2nd ed.)
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
SIAM Journal on Computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Relatively recursive reals and real functions
Theoretical Computer Science - Special issue on real numbers and computers
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Weakly computable real numbers
Journal of Complexity
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
A characterization of c.e. random reals
Theoretical Computer Science
Randomness and Recursive Enumerability
SIAM Journal on Computing
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Information Processing Letters
Presentations of computably enumerable reals
Theoretical Computer Science
Program-Size Complexity of Initial Segments and Domination Reducibility
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Recursively Enumerable Reals and Chaitin Omega Numbers
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Applications of computability theory to prime models and differential geometry
Applications of computability theory to prime models and differential geometry
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Undecidability of the structure of the Solovay degrees of c.e. reals
Journal of Computer and System Sciences
Universal Recursively Enumerable Sets of Strings
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Structures of Some Strong Reducibilities
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Relative Randomness and Real Closed Fields
Electronic Notes in Theoretical Computer Science (ENTCS)
Universal recursively enumerable sets of strings
Theoretical Computer Science
Computably enumerable sets in the solovay and the strong weak truth table degrees
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Universal computably enumerable sets and initial segment prefix-free complexity
Information and Computation
Initial segment complexities of randomness notions
Information and Computation
| Hi-index | 0.00 |
We study reducibilities that act as measures of relative randomness on reals, concentrating particularly on their behavior on the computably enumerable reals. One such reducibility, called domination or Solovay reducibility, has already proved to be a powerful tool in the study of randomness of effectively presented reals. Motivated by certain shortcomings of Solovay reducibility, we introduce two new measures of relative randomness and investigate their properties and the relationships between them and Solovay reducibility.