关于正规数的Kamae-Weiss定理的数学类比
Algorithmic analogies to kamae-Weiss theorem on normal numbers
摘要：
本文研究了随机数的连续性。Kamae（1973）研究了只依赖于坐标的选择函数，给出了选择函数的序列为正规数的充要条件。在van Lambalgen（1987）中，根据算法的随机性和Kolmogorov复杂性，对该定理进行了算法类比。在本文中，我们展示了不同的算法类比定理。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
