Abstract
In this paper we study subsequences of random numbers. In Kamae (1973), selection functions that depend only on coordinates are studied, and their necessary and sufficient condition for the selected sequences to be normal numbers is given. In van Lambalgen (1987), an algorithmic analogy to the theorem is conjectured in terms of algorithmic randomness and Kolmogorov complexity. In this paper, we show different algorithmic analogies to the theorem. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Takahashi, H. (2013). Algorithmic analogies to Kamae-Weiss theorem on normal numbers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7070 LNAI, pp. 411–416). Springer Verlag. https://doi.org/10.1007/978-3-642-44958-1_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
