 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.