A Pseudo-Random Generator Whose Output is a Normal Sequence
From MaRDI portal
Publication:6114852
DOI10.1142/s0129054121500325zbMath1522.68249OpenAlexW3199238173MaRDI QIDQ6114852
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
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Random number generation in numerical analysis (65C10)
Cites Work
- Unnamed Item
- Handbook of computational statistics. Concepts and methods.
- Do stronger definitions of randomness exist?
- Kolmogorov-Loveland randomness and stochasticity
- Algorithmic Randomness and Complexity
- Calibrating Randomness
- TestU01
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
- Elements of Information Theory
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: A Pseudo-Random Generator Whose Output is a Normal Sequence