Randomness Relative to Cantor Expansions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Chaotic Dynamics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/80457

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/nlin/0304019
 http://arxiv.org/abs/nlin/0304019
 Communications in Nonlinear Science and Numerical Simulation 10(8), 921-930 (2005)
 doi:10.1016/j.cnsns.2004.05.003

Collections

arXiv