Elementary Proof of a Theorem of Jean Ville
Elliott H. Lieb, Daniel Osherson, Scott Weinstein
Abstract
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.
Create a lesson
Related papers
An Optimal Separation Between Certificate Complexity and Approximate Degree
Kaspars Balodis
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
Gregory Morse
A note on the Σ2P-completeness of the Frobenius number
Thomas Rothvoss
The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue
Francesco Di Cosmo, Soumodev Mal, Tephilla Prince
It's Hard to PArcK
Kyle Burke, Jeffrey Leman, Craig Tennenhouse
Hardness of Approximation of Rank Aggregation on Ulam Metric
Sk Ruhul Azgor, Diptarka Chakraborty, Le Van Cuong et al.