The Mersenne Twister is a general purpose pseudorandom number generator built to produce long, statistically well-behaved sequences of numbers for simulation and modeling work. Makoto Matsumoto and Takuji Nishimura developed it in 1997 specifically to overcome weaknesses in earlier random number generators of the time. It works by combining a twisted generalized feedback shift register, a linear recurrence computed over bit vectors, with a later tempering step that improves the statistical quality of the raw output. Its name comes from the choice of a Mersenne prime to set its period length; the most widely used version, MT19937, repeats only after two to the power of 19,937 minus one values, an enormously long cycle that has made the algorithm the default random number generator in many programming languages, though it is not suitable for cryptographic use because its output can be predicted once enough of the sequence has been observed.
Facts
Time Complexity
Time Complexity (category) Connections
In Field
Source Mersenne Twister (Wikipedia)
Sources
1. Mersenne Twister Algorithm (Wikipedia)
Wikipedia infobox: time complexity constantQuote, Wikipedia infobox: time complexity constant
constant
View the Source Mersenne Twister (Wikipedia)
In Field: Algorithms and Complexity Theory, LeadQuote, In Field: Algorithms and Complexity Theory, Lead
The most commonly used version of the Mersenne Twister algorithm is based on the Mersenne prime 2 19937 − 1 {\displaystyle 2^{19937}-1} .
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.