MASON-INTEREST-L Archives

February 2009

MASON-INTEREST-L@LISTSERV.GMU.EDU

Options: Use Monospaced Font
Show HTML Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
From:
Miles Parker <[log in to unmask]>
Reply To:
MASON Multiagent Simulation Toolkit <[log in to unmask]>
Date:
Tue, 3 Feb 2009 18:26:49 -0800
Content-Type:
multipart/alternative
Parts/Attachments:
text/plain (679 bytes) , text/html (1086 bytes)

On Feb 3, 2009, at 4:45 PM, Sean Luke wrote:

> Miles Parker wrote:
>
>> And correct me if I'm wrong, but there are some algorithms in which  
>> using a prime number would be a bad idea. Anyway, it seems to me  
>> that any decent random stream generator should be able to take an  
>> arbitrary seed and produce a good result.
>
> Primes etc. are really a figment of early linear congruential  
> generators, for which non-prime parameters in the generator itself  
> were famously bad choices (actually, not just non-prime but non- 
> relatively-prime).  Knuth III is very interesting in that regard.

We're going to have to start calling you Mr. RNG. :) Any particular  
references in TAOCP?



ATOM RSS1 RSS2