Elementary Proof of a Theorem of Jean Ville

Details Elementary Proof of a Theorem of Jean Ville Elementary Proof of a Theorem of Jean Ville

2006-07-11

arxiv.org/abs/cs/0607054v1

Computer Science

Computational Complexity

12 pages latex

Scientific paper

Considerable thought has been devoted to an adequate definition of the class of infinite, random binary sequences (the sort of sequence that almost certainly arises from flipping a fair coin indefinitely). The first mathematical exploration of this problem was due to R. Von Mises, and based on his concept of a "selection function." A decisive objection to Von Mises' idea was formulated in a theorem offered by Jean Ville in 1939. It shows that some sequences admitted by Von Mises as "random" in fact manifest a certain kind of systematicity. Ville's proof is challenging, and an alternative approach has appeared only in condensed form. We attempt to provide an expanded version of the latter, alternative argument.

Affiliated with

Also associated with

No associations

Rating

Elementary Proof of a Theorem of Jean Ville 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 Elementary Proof of a Theorem of Jean Ville, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elementary Proof of a Theorem of Jean Ville will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138078