This article will be permanently flagged as inappropriate and made unaccessible to everyone. Are you certain this article is inappropriate? Excessive Violence Sexual Content Political / Social
Email Address:
Article Id: WHEBN0000048256 Reproduction Date:
The concept of a random sequence is essential in probability theory and statistics. The concept generally relies on the notion of a sequence of random variables and many statistical discussions begin with the words "let X_{1},...,X_{n} be independent random variables...". Yet as D. H. Lehmer stated in 1951: "A random sequence is a vague notion... in which each term is unpredictable to the uninitiated and whose digits pass a certain number of tests traditional with statisticians".^{[1]}
Axiomatic probability theory deliberately avoids a definition of a random sequence.^{[2]} Traditional probability theory does not state if a specific sequence is random, but generally proceeds to discuss the properties of random variables and stochastic sequences assuming some definition of randomness. The Bourbaki school considered the statement "let us consider a random sequence" an abuse of language.^{[3]} During the 20th century various technical approaches to defining random sequences were developed and now three distinct paradigms can be identified.
Émile Borel was one of the first mathematicians to formally address randomness in 1909.^{[4]} 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.^{[5]}
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 recursive function which having read the first N elements of the sequence decides if it wants to select element number N+1. Church was a pioneer in the field of computable functions, and the definition he made relied on the Church Turing Thesis for computability.^{[6]} This definition is often called Mises-Church randomness.
In the mid 1960s, A. N. Kolmogorov and D. W. Loveland independently proposed a more permissive selection rule.^{[7]}^{[8]} In their view Church's recursive function definition was too restrictive in that it read the elements in order. Instead they proposed a rule based on a partially computable process which having read any N elements of the sequence, decides if it wants to select another element which has not been read yet. This definition is often called Kolmogorov-Loveland stochasticity. But this method was considered too weak by Alexander Shen who showed that there is a Kolmogorov-Loveland stochastic sequence which does not conform to the general notion of randomness.
In 1966 Per Martin-Löf introduced a new notion which is now generally considered the most satisfactory notion of algorithmic randomness. His original definition involved measure theory, but it was later shown that it can be expressed in terms of Kolmogorov complexity. Kolmogorov's definition of a random string was that it is random if has no description shorter than itself via a universal Turing machine.^{[9]}
Three basic paradigms for dealing with random sequences have now emerged:^{[10]}
In most cases, theorems relating the three paradigms (often equivalence) have been proven.^{[12]}
It is important to realize that for each of the definitions given above for infinite sequences, if one adds a billion zeros to the front of the random sequence the new sequence will still be considered random. Hence any application of these concepts to practical problems needs to be performed with care.^{[13]}
Probability theory, Regression analysis, Mathematics, Observational study, Calculus
Mathematics, Statistics, Game theory, Combinatorics, Probability
Warsaw, Classical antiquity, Christianity, Sudan, Numismatics
European Union, Kraków, Berlin, World War II, Paris
Alan Turing, Washington, D.C., Computer science, United States, Logic
S, William Shakespeare, Hamlet, Cicero, Statistical mechanics
Statistics, Pi, Chaos theory, Quantum mechanics, Game theory
Probability theory, Stochastic process, Random sequence, Joint probability distribution, Invariant (mathematics)
Pi, Randomness, Dice, Gambling, Poker
Statistics, Mathematics, Finance, Probability theory, Probability