Further to the recent discussion of pseudorandom numbers, I have now been able to obtain and make available the thesis _General Hashing_ and paper on hashing. Chapter 5 of the thesis discusses generating aperiodic [sic] pseudorandom numbers. I have almost completed an implementation of this in Haskell. An attraction of this technique is that a good splitRandomSupply function is easy to implement. The URLs: http://www.cl.cam.ac.uk/users/kw217/pub/Hash.adt.ps.gz (37K) http://www.cl.cam.ac.uk/users/kw217/pub/Matt-Thesis.ps.gz (411K) Enjoy. --KW 8-)
