scientific article; zbMATH DE number 4043283

zbMATH Open0639.68078MaRDI QIDQ3780469FDOQ3780469

Authors: Ivan Kramosil 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3890727
• scientific article
• Publication:4727429
• scientific article; zbMATH DE number 3974332
• scientific article; zbMATH DE number 270263

zbMATH Keywords

probability measurefinite alphabetpseudo-random sequencesKolmogorov algorithmic complexitypseudo-Markov 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 (16)

• Title not available (Why is that?)
• PATTERN DEFINITION AND INFERENCE WITH STOCHASTIC PROCESSES
• Title not available (Why is that?)
• On a theorem of gács
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Randomness relative to Cantor expansions
• On the notion of infinite pseudorandom sequences
• Title not available (Why is that?)
• Everywhere complex sequences and the probabilistic method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kolmogorov complexity, pseudorandom generators and statistical models testing.

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)