Anonymous user
User talk:Ce: Difference between revisions
Pascal
(Pascal) |
|||
Line 24:
: Of course it would have exactly the same probability as the sequence "1111111111111111111111111111...", which would be rejected by the tester. The point is, in both cases we have a model which gives the data with significantly higher probability than pure randomness (in the specific cases here, the probability is 1 for the deterministic model vs. 1/7^28 for pure randomness). Of course, strictly speaking all PRNGs should be flagged non-random because we have a model which fits perfectly - the algorithm for the PRNG. However, if the PRNG is good, you cannot guess the algorithm from the output. --[[User:Ce|Ce]] 22:09, 30 September 2009 (UTC)
== Pascal ==
Thanks for the heads-up on the Pascal booleans. It's been 16 years since I wrote my last line of Pascal code. :-) --[[User:Snoman|Snoman]] 10:05, 25 July 2010 (UTC)
| |||