弱随机性与正规数的Kamae定理
Weak randomness and Kamae's theorem on normal numbers
摘要:
从序列到它们的连续性的函数称为选择函数。一个选择函数被称为容许的(相对于正常数),如果对所有正常数,他们的连续性得到的选择函数是正常数。Kamae(1973)研究了不依赖于序列(只依赖于坐标)的选择函数,给出了它们可容许的充要条件。在本文中,我们引入了弱随机性的概念,并研究了算法类比的Kamae定理。
英文摘要:
A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are normal numbers. In Kamae (1973) selection functions that are not depend on sequences (depend only on coordinates) are studied, and their necessary and sufficient condition for admissibility is given. In this paper we introduce a notion of weak randomness and study an algorithmic analogy to the Kamae's theorem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。