Re: "All random number generators eventually exhibit periodicity"?????

From: Lassi Hippeläinen (lahippel_at_ieee.orgies.invalid)
Date: 07/21/04 

Date: Wed, 21 Jul 2004 11:13:50 GMT

Guy Macon wrote:
>
> Guy Macon <http://www.guymacon.com> says...

> >Actually, I was not assuming that the universe is not a finite
> >state machine or that its lifetime is sufficiently short. I was
> >assuming (based on my expertise as an engineer) that the lifetime of
> >all of the devices listed above is sufficiently short.

I suggest adding three new standard keywords to RFC language:
"MANUAL" using means outside the scope of this document
"FOREVER" until next MANUAL reconfiguration
"NEVER" not before next MANUAL reconfiguration

> >By "sufficiently short" I mean "not infinite"; based on my belief that
> >it takes an infinite amount of data to be *completely* sure that a data
> >stream is indeed periodic. 01010101...(1 billion years)...0101010111111
> >111111111...(2 billion years)...11111111000011101100100110000000000...
>
> Looking at the above, I realise that I made an error in my thinking.
> Clearly my belief that it takes an infinite amount of data to be
> sure that a data stream is periodic assumes that the universe is not
> a finite state machine.

Penrose Tilings are aperiodic in any direction, even though they use
only two kinds of tiles. If you can translate a Penrose Tiling to a bit
string, you know it is aperiodic.

-- Lassi

Relevant Pages

  • Re: "All random number generators eventually exhibit periodicity"?????
    ... > state machine or that or its lifetime is sufficiently short. ... implementations of RNGs, as opposed to the possible properties of RNGs ... good model for the universe is still open to question. ...
    (sci.crypt)
  • Re: formatted data
    ... you mean i should create a state machine? ... but i'm not making a "data stream" ... the clocks that arrive are programmed in ns, ...
    (comp.lang.verilog)
Loading