Recovering randomness from an asymptotic Hamming distance

Details Recovering randomness from an asymptotic Hamming distance Recovering randomness from an asymptotic Hamming distance

2010-08-04

arxiv.org/abs/1008.0821v1

Mathematics

Logic

Working paper

Scientific paper

A notion of asymptotic Hamming distance suitable for the study of algorithmic randomness of infinite binary sequences is developed. As an application, it is shown that there is no fixed procedure that computes a Mises-Wald-Church stochastic sequence from a complex sequence. Here a sequence is complex if its prefixes have Kolmogorov complexity bounded below by an unbounded, nondecreasing computable function.

Affiliated with

Also associated with

No associations

Rating

Recovering randomness from an asymptotic Hamming distance 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 Recovering randomness from an asymptotic Hamming distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recovering randomness from an asymptotic Hamming distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-83152