Newsgroups: comp.ai,comp.ai.philosophy,comp.ai.alife
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!newsstand.cit.cornell.edu!portc01.blue.aol.com!newsxfer2.itd.umich.edu!howland.erols.net!www.nntp.primenet.com!nntp.primenet.com!netcom.com!jqb
From: jqb@netcom.com (Jim Balter)
Subject: Re: rand() - implementation ideas [Q]
Message-ID: <jqbE05snH.IHs@netcom.com>
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
References: <54lr8o$ndm@nntp.seflin.lib.fl.us> <54v9ol$fee@totara.its.vuw.ac.nz> <54vfm5$fi8@nw101.infi.net> <3278EDC2.1CFB@ucl.ac.uk>
Date: Thu, 31 Oct 1996 21:21:17 GMT
Lines: 14
Sender: jqb@netcom23.netcom.com
Xref: glinda.oz.cs.cmu.edu comp.ai:41799 comp.ai.philosophy:48082 comp.ai.alife:6773

In article <3278EDC2.1CFB@ucl.ac.uk>,
Bjoern Guenzel  <b.guenzel@ucl.ac.uk> wrote:
>I guess it is not really practical, but I wonder how random the
>transportation of data over the internet is? Perhaps the time intervalls
>between different 'packages' could be used? 

There are regularities in system scheduling and timing, and there are actually
spoofing methods that rely to some degree on anticipating packet timing.



-- 
<J Q B>

