Difference between revisions of ""random number" generators"

From GcatWiki
Jump to: navigation, search
 
 
Line 1: Line 1:
 
[http://www.random.org/ Random dot Org]
 
[http://www.random.org/ Random dot Org]
 +
 +
== Pseudo Random Number Generators ==
 +
Algorithms which create a series of numbers having the qualities of randomness, but are deterministic.  Not truely random, but maybe could be used in combination with true random numbers as seed values to increase the generation rate.
 +
 +
[http://www1.i2r.a-star.edu.sg/~knandakumar/nrg/Tms/Probability/Probgenerator.htm Linear Congruential RNG]
 +
 +
[http://random.mat.sbg.ac.at/generators/wsc95/inversive/node2.html Inversive RNG]
 +
 +
Linear feedback shift register (usually hardware implemented, can't find a decent link)
 +
 +
== Cellular Automata ==
 +
The repeated application of simple rules to array cells containing values from a finite set can result in emerged behavior over time.  Cellular Automata demonstrates this and provides interesting possibilities for randomness from complexity.
 +
 +
[http://mathworld.wolfram.com/CellularAutomaton.html General Summary of Cellular Automata from Wolfram]
 +
 +
[http://mathworld.wolfram.com/ElementaryCellularAutomaton.html Elementary Rulesets from Wolfram]
 +
 +
[http://www.stephenwolfram.com/publications/articles/ca/86-random/ Wolframs 1986 Publication on Random Sequences with CA]
 +
 +
[http://www.tcm.phy.cam.ac.uk/~tmf20/PUBLICATIONS/epl_08b.pdf When are cellular automata random?]
 +
 +
[http://home.southernct.edu/~pasqualonia1/ca/report.html A 256 state CA Random Number Generator]

Latest revision as of 05:39, 16 April 2010

Random dot Org

Pseudo Random Number Generators

Algorithms which create a series of numbers having the qualities of randomness, but are deterministic. Not truely random, but maybe could be used in combination with true random numbers as seed values to increase the generation rate.

Linear Congruential RNG

Inversive RNG

Linear feedback shift register (usually hardware implemented, can't find a decent link)

Cellular Automata

The repeated application of simple rules to array cells containing values from a finite set can result in emerged behavior over time. Cellular Automata demonstrates this and provides interesting possibilities for randomness from complexity.

General Summary of Cellular Automata from Wolfram

Elementary Rulesets from Wolfram

Wolframs 1986 Publication on Random Sequences with CA

When are cellular automata random?

A 256 state CA Random Number Generator