Message from discussion
Implementing the KISS4691 RNG
Path: g2news1.google.com!news2.google.com!goblin1!goblin3!goblin.stu.neva.ru!exi-transit.telstra.net!news.telstra.net!exi-spool.telstra.net!exi-reader.telstra.net!not-for-mail
From: "robin" <robi...@dodo.com.au>
Newsgroups: sci.math,comp.lang.c,comp.lang.fortran
References: <93b6ca11-f4ae-4598-98f8-9a10be69ca3a@j18g2000yqd.googlegroups.com> <8eifrsFhq7U1@mid.individual.net> <4c84b2c3$0$45653$c30e37c6@exi-reader.telstra.net> <8ejqjaFhq7U6@mid.individual.net>
Subject: Re: Implementing the KISS4691 RNG
Date: Mon, 6 Sep 2010 19:36:21 +1000
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2900.5931
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.5931
Lines: 12
Message-ID: <4c84b61d$0$45652$c30e37c6@exi-reader.telstra.net>
NNTP-Posting-Host: 123.3.23.35
X-Trace: 1283765789 exi-reader.telstra.net 45652 123.3.23.35:1051
"Ian Collins" <ian-n...@hotmail.com> wrote in message news:8ejqjaFhq7U6@mid.individual.net...
| On 09/ 6/10 09:22 PM, robin wrote:
| > It's for 32 bit words.
| > As previously, for longer words, it's necessary to truncate.
|
| Then it shouldn't make assumptions about the sizes of types.
It doesn't.
Find the phrase "in mod 2^32 arithmetic" in George's posting.