On 6/28/2015 2:38 AM, 'scerir' via Everything List wrote:
True randomness is not computable by (at least one) definition of "random".
But a good pseudo-random number generator would not be detectable for many
steps
(SFMT period = 2^216091).
-Brent
That reminds me of Saint T
Chaotica Delenda Est!
-Original Message-
From: 'scerir' via Everything List
To: everything-list
Sent: Sun, Jun 28, 2015 5:38 am
Subject: R: Re: A riddle for John Clark
True randomness is not computable by (at least one) definition of "random".
But
True randomness is not computable by (at least one) definition of
"random".
But a good pseudo-random number generator would not be
detectable for many steps (SFMT period = 2^216091).
-Brent
That reminds me of Saint Thomas Aquinas: "Therefore, it is not contrary to
divine providen
3 matches
Mail list logo
