Randomness Relative to Cantor Expansions
classification
🌊 nlin.CD
keywords
alphabetletterchosenelementsrandomnesssequenceabovealgorithmic
read the original abstract
Imagine a sequence in which the first letter comes from a binary alphabet, the second letter can be chosen on an alphabet with 10 elements, the third letter can be chosen on an alphabet with 3 elements and so on. When such a sequence can be called random? In this paper we offer a solution to the above question using the approach to randomness proposed by Algorithmic Information Theory.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.