Deciding a Bitstring of 1s is Non-Random is Impossible in General

Eric Holloway
2021 Communications of the Blyth Institute  
Without domain knowledge, an algorithm given an extremely long sequence of 1s would be unsure whether the sequence is completely random. When asked to predict the next digit, the algorithm can only give an equal weighting to 0 and 1.
doi:10.33014/issn.2640-5652.3.1.holloway.1 fatcat:kvixkl56qnez3g73ldso4to22y