Weak randomness and Kamae's theorem on normal numbers

Details Weak randomness and Kamae's theorem on normal numbers Weak randomness and Kamae's theorem on normal numbers

2011-02-16

arxiv.org/abs/1102.3242v1

Computer Science

Information Theory

submitted to ISIT2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Weak randomness and Kamae's theorem on normal numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weak randomness and Kamae's theorem on normal numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weak randomness and Kamae's theorem on normal numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416723