scientific article; zbMATH DE number 4201625

MaRDI QIDQ3350762zbMATH OpenFDO

Authors Ivan Kramosil

Publication date 1988

zbMATH Keywords

Kolmogorov algorithmic complexitypseudo-Markov chainspseudo-random sequencesTuring machines

Mathematics Subject Classification ID

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

Cited in

(12)

• On the notion of infinite pseudorandom sequences
• Kolmogorov complexity, pseudorandom generators and statistical models testing.
• scientific article; zbMATH DE number 3866254 (Why is no real title available?)
• scientific article; zbMATH DE number 3890727 (Why is no real title available?)
• scientific article; zbMATH DE number 4211347 (Why is no real title available?)
• scientific article; zbMATH DE number 3974332 (Why is no real title available?)
• scientific article; zbMATH DE number 4011516 (Why is no real title available?)
• scientific article; zbMATH DE number 4043283 (Why is no real title available?)
• EXTENSIONAL PROCESSING OF PROBABILITY MEASURES
• scientific article; zbMATH DE number 4001482 (Why is no real title available?)
• scientific article; zbMATH DE number 270263 (Why is no real title available?)
• On the algorithmic complexity of static structures

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 Q3350762)