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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brudno, A.A.: Entropy and the complexity of the trajectories of a dynamical system. Trans. Mosc. Math. Soc. 44, 127–151 (1983)
Chaitin, G.J.: A theory of program size formally identical to information theory. J. ACM 22, 329–340 (1975)
Dowe, D.L.: MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness. In: Bandyopadhyay, P.S., Foster, M. (eds.) Handbook of the Philosophy of Science. Philosophy of Statistics, vol. 7, Elsevier (2011)
Hochman, M.: Upcrossing inequalities for stationary sequences and applications. Ann. Probab. 37(6), 2135–2149 (2009)
Kamae, T.: Subsequences of normal numbers. Israel J. Math. 16, 121–149 (1973)
Kamae, T., Takahashi, H.: Statistical problems related to irrational rotations. Ann. Inst. Statist. Math. 58(3), 573–593 (2006)
Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Inf. Transm. 1(1), 1–7 (1965)
Li, M., Vitányi, P.: An introduction to Kolmogorov complexity and Its applications, 3rd edn. Springer, New York (2008)
Martin-Löf, P.: The definition of random sequences. Information and Control 9, 602–609 (1966)
Shen, A.K.: On relations between different algorithmic definitions of randomness. Soviet Math. Dokl. 38(2), 316–319 (1989)
Solomonoff, R.J.: A formal theory of inductive inference, part 1 and part2. Inform. Contr. 7, 1–22, 224–254 (1964)
Takahashi, H., Aihara, K.: Algorithmic analysis of irrational rotations in a single neuron model. J. Complexity 19, 132–152 (2003)
van Lambalgen, M.: Random sequences. PhD thesis, Universiteit van Amsterdam (1987)
V’yugin, V.V.: Ergodic theorems for individual random sequences. Theor. Comp. Sci. 207, 343–361 (1998)
Weiss, B.: Normal sequences as collectives. In: Proc. Symp. on Topological Dynamics and Ergodic Theory. Univ. of Kentucky (1971)
Weiss, B.: Single Orbit Dynamics. Amer. Math. Soc. (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Takahashi, H. (2013). Algorithmic Analogies to Kamae-Weiss Theorem on Normal Numbers. In: Dowe, D.L. (eds) Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. Lecture Notes in Computer Science, vol 7070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44958-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-44958-1_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44957-4
Online ISBN: 978-3-642-44958-1
eBook Packages: Computer ScienceComputer Science (R0)