Article
Version 1
Preserved in Portico This version is not peer-reviewed
An Informational Test for Random Finite Strings
Version 1
: Received: 9 November 2018 / Approved: 15 November 2018 / Online: 15 November 2018 (10:37:31 CET)
A peer-reviewed article of this Preprint also exists.
Bonnici, V.; Manca, V. An Informational Test for Random Finite Strings. Entropy 2018, 20, 934. Bonnici, V.; Manca, V. An Informational Test for Random Finite Strings. Entropy 2018, 20, 934.
Abstract
In this paper, by extending some results of informational genomics, we present a new randomness test based on the empirical entropy of strings and some properties of repeatability and unrepeatability of substrings of certain lengths. We give the theoretical motivations of our method and some experimental results of its application to a wide class of strings: decimal representations of real numbers, roulette outcomes, logistic maps, linear congruential generators, quantum measurements, natural language texts, and genomes. It will be evident that the evaluation of randomness resulting from our tests does not distinguish among the different sources of randomness (natural, or pseudo-casual).
Keywords
Algorithmic Information Theory; Incompressibility; Typicality; Randomness Test; Pseudo-random Generators; k-mer Multiplicity; k-Entropy; Informational indexes
Subject
Computer Science and Mathematics, Applied Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
