Randomness Relative to Cantor Expansions
arXiv:nlin/0304019 · doi:10.1016/j.cnsns.2004.05.003
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.
several small changes