Preprint series: 04-23, Reports on Computer Science
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.
Such sequences occur in various physical contexts,
in which the coding of experimental outcome varies with scale.
When can such a sequence be called random? In this paper we offer
a solution to the above question using the approach to randomness proposed
by Algorithmic Information Theory.
Keywords: random sequences, Cantor expansion
Upload: 2004-07-12