The Distinction Between Fixed and Random Generators in Group-Based Assumptions

2019 ◽  
pp. 801-830 ◽  
Author(s):  
James Bartusek ◽  
Fermi Ma ◽  
Mark Zhandry
Keyword(s):  
Random Generators

scholarly journals Stochastic evolution equations with random generators

1998 ◽  
Vol 26 (1) ◽  
pp. 149-186 ◽  
Author(s):  
Jorge A. Le{\'o}n ◽  
David Nualart
Keyword(s):  
Evolution Equations ◽  
Stochastic Evolution ◽  
Stochastic Evolution Equations ◽  
Random Generators

scholarly journals A note on Yao’s theorem about pseudo-random generators

2011 ◽  
Vol 3 (4) ◽  
pp. 189-206 ◽  
Author(s):  
Stéphane Ballet ◽  
Robert Rolland
Keyword(s):  
Random Generators

scholarly journals Randomness: Quantum versus classical

2016 ◽  
Vol 14 (04) ◽  
pp. 1640009 ◽  
Author(s):  
Andrei Khrennikov
Keyword(s):  
Information Theory ◽  
Related Problem ◽  
Short Review ◽  
Quantum Information Theory ◽  
Quantum Foundations ◽  
Interpretation Of Quantum Mechanics ◽  
New Wave ◽  
Quantum Randomness ◽  
Information Interpretation ◽  
Random Generators

Recent tremendous development of quantum information theory has led to a number of quantum technological projects, e.g. quantum random generators. This development had stimulated a new wave of interest in quantum foundations. One of the most intriguing problems of quantum foundations is the elaboration of a consistent and commonly accepted interpretation of a quantum state. Closely related problem is the clarification of the notion of quantum randomness and its interrelation with classical randomness. In this short review, we shall discuss basics of classical theory of randomness (which by itself is very complex and characterized by diversity of approaches) and compare it with irreducible quantum randomness. We also discuss briefly “digital philosophy”, its role in physics (classical and quantum) and its coupling to the information interpretation of quantum mechanics (QM).

Evaluation of splittable pseudo-random generators

2015 ◽  
Vol 25 ◽  
Author(s):  
HANS GEORG SCHAATHUN
Keyword(s):  
Parallel Processing ◽  
Functional Programming ◽  
Random Number ◽  
Fundamental Problem ◽  
Random Number Generation ◽  
Large Classes ◽  
Sequential Processing ◽  
Programming Paradigm ◽  
Random Generators ◽  
Standard Library

AbstractPseudo-random number generation is a fundamental problem in computer programming. In the case of sequential processing the problem is very well researched, but parallel processing raises new problems whereof far too little is currently understood. Splittable pseudo-random generators (S-PRNG) have been proposed to meet the challenges of parallelism. While applicable to any programming paradigm, they are designed to be particularly suitable for pure functional programming. In this paper, we review and evaluate known constructions of such generators, and we identify flaws in several large classes of generators, including Lehmer trees, the implementation in Haskell's standard library, leapfrog, and subsequencing (substreaming).

Sign in / Sign up

Export Citation Format

Share Document