Unpredictable strings

zbMATH Open1488.65729arXiv2006.08523MaRDI QIDQ5154375FDOQ5154375

Authors: A. Tola, M. Akhmet 

Publication date: 4 October 2021

Abstract: A novel notion of unpredictable strings is revealed and utilized to define deterministic unpredictable sequences on a finite number of symbols. We prove the first law of large strings for random processes in discrete time, which confirms that there exists the uncountable set of unpredictable realizations. The hypothesis on the second law of large strings is formulated, which is relative to the Bernoulli theorem. Theoretical and numerical backgrounds for the laws are provided.

Full work available at URL: https://arxiv.org/abs/2006.08523

Recommendations

• Unpredictable strings are collectives
• scientific article; zbMATH DE number 4135865
• How many strings are easy to predict?
• How many strings are easy to predict?
• scientific article; zbMATH DE number 4089442

zbMATH Keywords

Bernoulli schemeBernoulli processunpredictable stringsfirst law of large stringssecond law of large stringsunpredictable sequences

Mathematics Subject Classification ID

Numerical chaos (65P20) Symbolic dynamics (37B10) General theory of stochastic processes (60G07)

Cited In (7)

• Unpredictable strings are collectives
• Compartmental Poisson Stability in Non-autonomous Differential Equations
• Unpredictability and the transmission of numbers
• Unpredictability in Markov chains
• How many strings are easy to predict?
• A randomly determined unpredictable function
• Situations as Strings

This page was built for publication: Unpredictable strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154375)