Re: Manansala Random Number Generator

Gerry Myerson wrote:
> In article <1118985495.372675.82200@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
> "Proginoskes" <proginoskes@xxxxxxxxxxxxx> wrote:
>
> > Jean-Claude Arbaut wrote:
> > > That was a joke initiated by Proginoskes:
> > > A "random number generator" is a "random (number generator)".
> > > Assume a "number generator" is a perfectly defined class of
> > > objects, then you can take one at random. Just take a dice
> > > for that :-)
> > > Ok, not a very good joke.
> >
> > And not initiated by me, either.
>
> I believe I deserve the credit/blame.
>
> > There is no such thing as a (random number) generator, but there are
> > pseudorandom number generators which can fool any pattern-searching
> > algorithm.
>
> Careful. For every pattern-searching algorithm (psa, for short)
> there is a pseudorandom number generator (prng) which can fool it.
> I don't think it's true that there exists a prng G such that, for
> every psa A, G can fool A.

Yes, I might not remember the result correctly. But something like this
IS true. Maybe instead, it's something like: There is a sequence of
numbers which no psa's can determine the next digit of.

--- Christopher Heckman

.

Relevant Pages

  • Re: Manansala Random Number Generator
    ... For every pattern-searching algorithm (psa, ... there is a pseudorandom number generator (prng) which can fool it. ...
    (sci.math)
  • Re: Manansala Random Number Generator
    ... Gerry Myerson wrote: ... For every PRNG G there is a PSA simply testing whether the given ... sequence matches G. So you are correct, no PRNG can fool every PSA. ...
    (sci.math)
  • Re: Manansala Random Number Generator
    ... For every pattern-searching algorithm (psa, ... > there is a pseudorandom number generator (prng) which can fool it. ...
    (sci.math)
  • Re: SHA-based subclass for random module
    ... The problem is that you want encryption. ... This sha prng module was motivated partly by your own remark in sf bug ... So I run it again using the crypto-based generator ... things usually aren't even thinking about cryptography. ...
    (comp.lang.python)
  • Re: How strong would randomizing data be ?
    ... In this case the entire pRNG can be ... > generator even if the seed is constantly different. ... > Well what techniques are applied which are different than say the twister ... The changes between a pRNG like twister and a block cipher are extensive ...
    (sci.crypt)
Quantcast