Open AccessDeciding a Bitstring of 1s is Non-Random is Impossible in General
Author(s) -
Eric Holloway
Publication year - 2021
Publication title -
communications of the blyth institute
Language(s) - English
Resource type - Journals
eISSN - 2640-5652
pISSN - 2640-5644
DOI - 10.33014/issn.2640-5652.3.1.holloway.1
Subject(s) - sequence (biology) , random sequence , weighting , computer science , domain (mathematical analysis) , algorithm , mathematics , arithmetic , combinatorics , theoretical computer science , medicine , mathematical analysis , genetics , distribution (mathematics) , radiology , biology
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.