Kolmogorov complexity, pseudorandom generators and statistical models testing.

MaRDI QIDQ3143837zbMATH OpenFDO

Authors J.Šindelář, Pavel Boček

Publication date 4 December 2012

Full work available at URL http://www.kybernetika.cz/content/2002/6/747/paper.pdf

zbMATH Keywords

Kolmogorov complexitypseudorandom generatortypical string

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 4043283
• Some consequences of the existnce of pseudorandom generators
• scientific article; zbMATH DE number 4211347
• Statistical properties of finite sequences with high Kolmogorov complexity
• scientific article; zbMATH DE number 4201625

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 4066011 (Why is no real title available?)
• scientific article; zbMATH DE number 3433226 (Why is no real title available?)
• scientific article; zbMATH DE number 270263 (Why is no real title available?)
• scientific article; zbMATH DE number 3404221 (Why is no real title available?)
• Kolmogorov complexity and probability measures.
• The definition of random sequences
• Theories of computational complexity

Cited in

(5)

• A measure of stochastic complexity and its power in testing for randomness.
• Kolmogorov complexity and probability measures.
• Achievable Key Rates for Universal Simulation of Random Data With Respect to a Set of Statistical Tests
• scientific article; zbMATH DE number 3941524 (Why is no real title available?)
• Robust Measures of Information

This page was built for publication: Kolmogorov complexity, pseudorandom generators and statistical models testing.

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