Random number generator (included): Difference between revisions

From Rosetta Code
Content added Content deleted
(New (draft) task and Python solution.)
 
No edit summary
Line 7: Line 7:
=={{header|Python}}==
=={{header|Python}}==
Python uses the [[wp:Mersenne twister|Mersenne twister]] algorithm accessed via the built-in [http://docs.python.org/library/random.html random module].
Python uses the [[wp:Mersenne twister|Mersenne twister]] algorithm accessed via the built-in [http://docs.python.org/library/random.html random module].

=={{header|Tcl}}==
Tcl uses a [[wp:Linear congruential generator|linear congruential generator]] in it's built-in <code>rand()</code> function. This is seeded by default from the system time, and kept per-interpreter so different security contexts and different threads can't affect each other's generators (avoiding key deployment issues with the rand function from [[C]]'s math library).

Citations (from Tcl source code):
* S.K. Park & K.W. Miller, “''Random number generators: good ones are hard to find'',” Comm ACM 31(10):1192-1201, Oct 1988
* W.H. Press & S.A. Teukolsky, “''Portable random number generators'',” Computers in Physics 6(5):522-524, Sep/Oct 1992.

Revision as of 08:44, 23 January 2010

Random number generator (included) is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

State the type of random number generator algorithm used in a languages built-in random number generator, or omit the language if no random number generator is given as part of the language or its immediate libraries.
If possible, a link to a wider explanation of the algorithm used should be given.

Note: the task is not to create an RNG, but to report on the languages in-built RNG that would be the most likely RNG used.

Python

Python uses the Mersenne twister algorithm accessed via the built-in random module.

Tcl

Tcl uses a linear congruential generator in it's built-in rand() function. This is seeded by default from the system time, and kept per-interpreter so different security contexts and different threads can't affect each other's generators (avoiding key deployment issues with the rand function from C's math library).

Citations (from Tcl source code):

  • S.K. Park & K.W. Miller, “Random number generators: good ones are hard to find,” Comm ACM 31(10):1192-1201, Oct 1988
  • W.H. Press & S.A. Teukolsky, “Portable random number generators,” Computers in Physics 6(5):522-524, Sep/Oct 1992.