Editing Random sequence (section)

==Early history==
[[Émile Borel]] was one of the first mathematicians to formally address randomness in 1909.<ref>E. Borel, ''Les probabilites denombrables et leurs applications arithmetique'' Rend. Circ. Mat. Palermo 27 (1909) 247–271</ref> In 1919 [[Richard von Mises]] gave the first definition of [[algorithmic randomness]], which was inspired by the law of large numbers, although he used the term ''collective'' rather than random sequence. Using the concept of the [[impossibility of a gambling system]], von Mises defined an infinite sequence of zeros and ones as random if it is not biased by having the ''frequency stability property'' i.e. the frequency of zeros goes to 1/2 and every sub-sequence we can select from it by a "proper" method of selection is also not biased.<ref>Laurant Bienvenu "Kolmogorov Loveland Stochasticity" in STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science by Wolfgang Thomas {{ISBN|3-540-70917-7}} page 260</ref>

The sub-sequence selection criterion imposed by von Mises is important, because although 0101010101... is not biased, by selecting the odd positions, we get 000000... which is not random. Von Mises never totally formalized his definition of a proper selection rule for sub-sequences, but in 1940 [[Alonzo Church]] defined it as any [[recursion#Functional recursion|recursive function]] which having read the first N elements of the sequence decides if it wants to select element number&nbsp;''N''&nbsp;+&nbsp;1. Church was a pioneer in the field of computable functions, and the definition he made relied on the [[Church Turing Thesis]] for computability.<ref>{{cite journal | last1 = Church | first1 = Alonzo | author-link = Alonzo Church | year = 1940 | title = On the Concept of Random Sequence | doi = 10.1090/S0002-9904-1940-07154-X| journal = Bull. Amer. Math. Soc. | volume = 46 | issue = 2| pages = 130–136 | doi-access = free }}</ref> This definition is often called ''Mises–Church randomness''.