A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Deciding a Bitstring of 1s is Non-Random is Impossible in General
2021
Communications of the Blyth Institute
Preserved Fulltext
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