Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
A walk along the branches of the extended Farey tree
IBM Journal of Research and Development
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Computable analysis: an introduction
Computable analysis: an introduction
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
The Kolmogorov complexity of real numbers
Theoretical Computer Science
Randomness as an Invariant for Number Representations
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Random elements in effective topological spaces with measure
Information and Computation
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
On the Number of Optimal Base 2 Representations of Integers
Designs, Codes and Cryptography
A sequentially computable function that is not effectively continuous at any point
Journal of Complexity
Hi-index | 0.00 |
The ordinary notion of algorithmic randomness of reals can be characterised as Martin-Löf randomness with respect to the Lebesgue measure or as Kolmogorov randomness with respect to the binary representation. In this paper we study the question of how the notion of algorithmic randomness induced by the signed-digit representation of the real numbers is related to the ordinary notion of algorithmic randomness. We first consider the image measure on real numbers induced by the signed-digit representation. We call this measure the signed-digit measure and using the Fourier transform of this measure and the Riemann-Lebesgue Lemma we prove that this measure is not absolutely continuous with respect to the Lebesgue measure. We also show that the signed-digit measure can be obtained as a weakly convergent convolution of discrete measures and therefore, by the classical Theorem of Jessen and Wintner the Lebesgue measure is not absolutely continuous with respect to the signed-digitmeasure. Finally, we provide an invariance theoremwhich shows that if a computable map preserves Martin-Löf randomness, then its induced image measure has to be absolutely continuous with respect to the target space measure. This theorem can be considered as a loose analog for randomness of the Banach-Mazur theorem for computability. Using this Invariance Theorem we conclude that the notion of randomness induced by the signed-digit representation is incomparable with the ordinary notion of randomness.