Randomness Relative to Cantor Expansions

Simple item page
dc.creatorCalude, Cristian S.
dc.creatorStaiger, Ludwig
dc.creatorSvozil, Karl
dc.date2003-04-11
dc.date2005-04-04
dc.date.accessioned2026-07-07T05:34:40Z
dc.date.available2026-07-07T05:34:40Z
dc.descriptionImagine 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.
dc.descriptionseveral small changes
dc.identifierhttps://arxiv.org/abs/nlin/0304019
dc.identifierhttp://arxiv.org/abs/nlin/0304019
dc.identifierCommunications in Nonlinear Science and Numerical Simulation 10(8), 921-930 (2005)
dc.identifierdoi:10.1016/j.cnsns.2004.05.003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/80457
dc.subjectChaotic Dynamics
dc.titleRandomness Relative to Cantor Expansions
dc.typetext

Files

Collections

arXiv