scientific article; zbMATH DE number 4043283

MaRDI QIDQ3780469zbMATH OpenFDO

Authors Ivan Kramosil

Publication date 1987

zbMATH Keywords

finite alphabetKolmogorov algorithmic complexityprobability measurepseudo-Markov sequencespseudo-random sequencesspace of infinite sequences of letters

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Analysis of algorithms and problem complexity (68Q25)

Cited in

(19)

• On the notion of infinite pseudorandom sequences
• Randomness relative to Cantor expansions
• Everywhere complex sequences and the probabilistic method
• 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 3878357 (Why is no real title available?)
• scientific article; zbMATH DE number 3890727 (Why is no real title available?)
• scientific article; zbMATH DE number 4201625 (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?)
• PATTERN DEFINITION AND INFERENCE WITH STOCHASTIC PROCESSES
• scientific article; zbMATH DE number 4071998 (Why is no real title available?)
• scientific article; zbMATH DE number 4081466 (Why is no real title available?)
• scientific article; zbMATH DE number 152107 (Why is no real title available?)
• A recipe for randomness
• On a theorem of gács
• scientific article; zbMATH DE number 4001482 (Why is no real title available?)
• scientific article; zbMATH DE number 270263 (Why is no real title available?)

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