Randomness Relative to Cantor Expansions
Chaotic Dynamics
2007-05-23 v2
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.
Cite
@article{arxiv.nlin/0304019,
title = {Randomness Relative to Cantor Expansions},
author = {Cristian S. Calude and Ludwig Staiger and Karl Svozil},
journal= {arXiv preprint arXiv:nlin/0304019},
year = {2007}
}
Comments
several small changes