Abstract
The notions “regularity index” and “randomness index” previously introduced for binary strings (2-ary) have been modified slightly and generalized for m-ary strings (m = 2, 3, 4, . . .). These notions are complementary and the regular/random dichotomy has been replaced by a gradation of values of regularity and of randomness. With this approach, the more regular an m-ary string, the less random it is, and vice versa. The distributions of frequencies of different length strings —2-ary and 3-ary strings— according to their indices of randomness, are shown by histograms.
References
Chaitin G.J. (1998) The Limits of Mathematics. Springer-Verlag, New York.
Chaitin, G.J. (2001) Exploring Randomness. Springer-Verlag, New York.
Pincus, S.; Singer, B. H. (1996) “Randomness and degrees of irregularity”, Proceedings of the National Academy of Scienes of the United States of America 93(5): 2083–2088.
Skliar, O.; Medina, V.; Oviedo G. (1995) “Un ı́ndice de aleatoriedad para cadenas binarias”, in: J. Trejos (Ed.) Memorias del IX Simposio Métodos Matemáticos Aplicados en las Ciencias, Turrialba: 161–172.
Volchan, S.B. (2002) “What is a random sequence?”, The American Mathematical Monthly 109(1): 46–63.