Numerical analysis Monte Carlo and quasi-Monte Carlo methods Concept
Pseudorandom number generator
Summary
A pseudorandom number generator is a deterministic algorithm that produces a sequence of numbers meant to look like independent uniform random numbers. It has a finite internal state, updated by a fixed map at each step. An output function reads a number from the state. Because the state space is finite, the sequence is eventually periodic, and the same seed always reproduces the same sequence. Such generators supply the randomness of almost all Monte Carlo computations and simulations.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | C5FG6ARWVV |
|---|---|
| URI | m2://C5FG6ARWVV |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65C10, 11K45 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.