Elementary Proof of a Theorem of Jean Ville

Simple item page
dc.creatorLieb, Elliott H.
dc.creatorOsherson, Daniel
dc.creatorWeinstein, Scott
dc.date2006-07-11
dc.date.accessioned2026-07-07T07:16:19Z
dc.date.available2026-07-07T07:16:19Z
dc.descriptionConsiderable 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.
dc.description12 pages latex
dc.identifierhttps://arxiv.org/abs/cs/0607054
dc.identifierhttp://arxiv.org/abs/cs/0607054
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113546
dc.subjectComputational Complexity
dc.titleElementary Proof of a Theorem of Jean Ville
dc.typetext

Files

Collections

arXiv