scientific article; zbMATH DE number 3866254

MaRDI QIDQ3333779zbMATH OpenFDO

Authors Ivan Kramosil

Publication date 1984

Full work available at URL https://eudml.org/doc/27615

zbMATH Keywords

algorithmic complexitycriterion of randomnessTuring machine

Mathematics Subject Classification ID

Foundations of probability theory (60A99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Publication:5749362
• Pseudorandomness of binary sequences derived from linear recursions
• Publication:4727429
• A comprehensive classification of pseudo-random binary sequences using difference sets†
• Pseudorandom sequences
• scientific article; zbMATH DE number 4081466
• scientific article; zbMATH DE number 4201625
• Pseudo-randomness of a class of generalized self-shrinking sequences
• Classification and realization of pseudo-random number generators
• scientific article; zbMATH DE number 4043283

Cited in

(1)

• Classifying non-periodic sequences by permutation transducers

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