Talk:Middle-square method
![]() | Computing Stub‑class ![]() | ||||||||||||
|
C++ code
Anyone who knows enough C++ to understand that code probably doesn't need it to be here. In any case, I don't think it is Wikipedia's place to provide code samples -- it is an encyclopedia. It would be better if how it worked was actually explained clearly, rather than via code, in my opinion. --Fastfission 04:40, 5 May 2006 (UTC)
And I think the code provided is incorrect. It returns a uint32, x = (x>>32) | (x<<32); but x is a uint64. Sliding it right 16 would be a start toward getting it right Friendly Person (talk) 22:13, 4 December 2019 (UTC)
Reference
Where does 1946 come from? Some cite J. von Neumann: Various techniques used in connection with random digits. Monte Carlo methods. Nat. Bur. of Stand., Appl. Math. Ser. 12, 1951. Has anyone access to this article? —Preceding unsigned comment added by 139.18.75.122 (talk) 11:38, 1 June 2010 (UTC)
... I found a short hint on "about 1946" in D.E. Knuth's book "The Art of Computer Programming", vol. 2 (3. ed.) in section 3.1, page 3. A primary source would be necessary anyway.
- I've seen the article; I don't think he mentions 1946 in it, but I don't have it in front of me, just notes. I've added a little bit. I don't know if 1946 was the first time he used it, it would be interesting to know for sure. I can date him describing it in 1949, which is at least pretty concrete. --Fastfission (talk) 23:10, 16 August 2010 (UTC)
- I ran across the article again. He doesn't mention 1946 in the 1949 article. --Fastfission (talk) 20:36, 23 June 2011 (UTC)
Middle Square Weyl Sequence PRNG
This section reads like it was written by the publisher of the RNG himself. Have been unable to find independent evaluations thereof.