[A83] Re: Randomization


[Prev][Next][Index][Thread]

[A83] Re: Randomization




Yes, this is the way it's done; Using a recursive function. But can you give 
us an example of such a function?


>From: Olle Hedman <alh@home.se>
>Reply-To: assembly-83@lists.ticalc.org
>To: assembly-83@lists.ticalc.org
>Subject: [A83] Re: Randomization
>Date: Tue, 11 Dec 2001 13:46:40 +0100
>MIME-Version: 1.0
>Received: from [195.67.128.9] by hotmail.com (3.2) with ESMTP id 
>MHotMailBDDF4BCB00CC4004315FC3438009077D0; Tue, 11 Dec 2001 04:49:46 -0800
>Received: from towerguard. (mx-1.sollentuna.net [195.67.128.9])by 
>mx-1.sollentuna.net (Postfix) with ESMTPid F0AAA18013; Tue, 11 Dec 2001 
>13:49:10 +0100 (CET)
>Received: with LISTAR (v1.0.0; list assembly-83); Tue, 11 Dec 2001 13:49:10 
>+0100 (CET)
>Received: from d188.ryd.student.liu.se (d188.ryd.student.liu.se 
>[130.236.235.188])by mx-1.sollentuna.net (Postfix) with SMTP id 
>905E518010for <assembly-83@lists.ticalc.org>; Tue, 11 Dec 2001 13:49:09 
>+0100 (CET)
>Received: (qmail 2437 invoked from network); 11 Dec 2001 12:49:28 -0000
>Received: from d170.ryd.student.liu.se (HELO d170.student.liu.se) 
>(ident@130.236.235.170)  by d188.ryd.student.liu.se with SMTP; 11 Dec 2001 
>12:49:28 -0000
>From assembly-83-bounce@lists.ticalc.org Tue, 11 Dec 2001 04:50:25 -0800
>Delivered-To: lists.ticalc-assembly-83@mx-1.sollentuna.net
>Message-Id: <5.1.0.14.0.20011211134227.034819c0@pop.home.se>
>X-Sender: alh@home.se@pop.home.se
>X-Mailer: QUALCOMM Windows Eudora Version 5.1
>In-Reply-To: <000001c18241$51e853f0$6e01a8c0@durantm>
>References: <20011211114203.54212.qmail@web13801.mail.yahoo.com>
>X-listar-version: Listar v1.0.0
>Sender: assembly-83-bounce@lists.ticalc.org
>Errors-To: assembly-83-bounce@lists.ticalc.org
>X-original-sender: alh@home.se
>Precedence: bulk
>X-list: assembly-83
>
>
>At 13:42 2001-12-11, you wrote:
>
> >Most processors have a stored list of "random" numbers.  They aren't
> >randomly generated in real-time...that's why they are called
> >pseudo-random...I'm not sure if this is how the calculators give random
> >numbers
>
>Not really. They don't have a list stored, but an more or less simple
>algoritm that gives you the same next number for each given starting number
>(seed).
>A simple algoritm -> fast, but less random (less evenly distributed numbers
>over the chosen interval)
>more advanced -> slower, but more evenly distributed.
>True random is impossible in a system like a processor, that is why it is
>called "pseudo-random", this and the fact that each seed gives the same 
>"list".
>But there is no list stored...
>
>///Olle
>
>
>
>


_________________________________________________________________
Download MSN Explorer gratis van http://explorer.msn.nl/intl.asp





Follow-Ups: