A Pseudo-Random Generator Whose Output is a Normal Sequence

DOI10.1142/S0129054121500325MaRDI QIDQ6114852zbMATH OpenOpenAlexFDO

Authors B. Ya. Ryabko

Publication date 15 August 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054121500325

zbMATH Keywords

normal sequencespseudo-random number generatorsrandomness testing

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Some properties of random number generators
• Pseudo-random number generator based on scrambled binary and quinary maximal-length sequences
• Random Generators and Normal Numbers
• Normal numbers and pseudorandom generators
• scientific article; zbMATH DE number 3881757

Cites work

• Algorithmic randomness and complexity.
• An introduction to Kolmogorov complexity and its applications
• Calibrating Randomness
• Do stronger definitions of randomness exist?
• Elements of Information Theory
• Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
• Handbook of computational statistics. Concepts and methods.
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• Kolmogorov-Loveland randomness and stochasticity
• TestU01

Cited in

(2)

• Some properties of random number generators
• scientific article; zbMATH DE number 3994872 (Why is no real title available?)

This page was built for publication: A Pseudo-Random Generator Whose Output is a Normal Sequence

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