From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,e3f74ab8a2c61af2,start
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Random Number Generation
Date: 1996/10/13
Message-ID: <dewar.845244462@merv>#1/1
X-Deja-AN: 189231066
references: <13OCT96.18283680@enh.nist.gov>
organization: New York University
newsgroups: comp.lang.ada
Date: 1996-10-13T00:00:00+00:00
List-Id: <comp.lang.ada>


Geert said

""I don't say it is not possible to present a correct algorithm
to convert R1 to R2. Such a correct algorithm just is not guaranteed to
finish in finite time.
"

Yes, this is guaranteed to finish in finite time if you are using a
compiler that meets the requirements of the numerics annex with regard
to the random number generator performance.