scientific article; zbMATH DE number 4135865

MaRDI QIDQ3469034zbMATH OpenFDO

Authors Alexei Pokrovskii

Publication date 1989

zbMATH Keywords

causalityKolmogorov complexitypredictorsunpredictability of binary sequences

Mathematics Subject Classification ID

Axioms; other general questions in probability (60A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication theory (94A05)

Recommendations

• Statistics of chaotic binary sequences
• On the measures of pseudorandomness of binary sequences.
• scientific article; zbMATH DE number 1740048
• On random binary sequences
• An unpredictability approach to finite-state randomness
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• A complexity measure for families of binary sequences
• Pseudo-randomness and complexity of binary sequences generated by the chaotic system
• scientific article; zbMATH DE number 1740058

Cited in

(8)

• An unpredictability approach to finite-state randomness
• Unpredictable strings are collectives
• How many strings are easy to predict?
• scientific article; zbMATH DE number 4089442 (Why is no real title available?)
• Antipersistent binary time series
• scientific article; zbMATH DE number 2086435 (Why is no real title available?)
• Unpredictable strings
• Unpredictability in Markov chains

This page was built for publication:

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