arXiv · nlin/0304019
Randomness Relative to Cantor Expansions
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.
Explore related subjects
Keep this discovery
Cristian S. Calude, Ludwig Staiger, Karl Svozil. 2005-04-04. Randomness Relative to Cantor Expansions. https://doi.org/10.1016/j.cnsns.2004.05.003
Cite the original work for its findings. Save a collection to share your selection of sources.