Computer Science – Information Theory
Scientific paper
2007-05-31
Computer Science
Information Theory
Theorem 4.15 replaced with a weaker version; several other minor changes
Scientific paper
The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure that transforms one input sequence into another sequence with higher randomness rate. By contrast, we display such a uniform effective procedure having as input two independent sequences with positive but arbitrarily small constant randomness rate. Moreover the transformation is a truth-table reduction and the output has randomness rate arbitrarily close to 1.
No associations
LandOfFree
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences 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 Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-289361