Algorithmic analogies to kamae-Weiss theorem on normal numbers

Details Algorithmic analogies to kamae-Weiss theorem on normal numbers Algorithmic analogies to kamae-Weiss theorem on normal numbers

2011-06-16

arxiv.org/abs/1106.3153v3

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algorithmic analogies to kamae-Weiss 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 Algorithmic analogies to kamae-Weiss theorem on normal numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic analogies to kamae-Weiss theorem on normal numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189579