Talk:The Art of Computer Programming: Difference between revisions

Revision as of 20:54, 27 September 2012

Revision as of 22:35, 10 February 2013

Line 77:

Knuth's homepage show sections 7.2 and 7.3 in volume 4A. So I will take the liberty of correcting that in the article. [[Special:Contributions/187.78.144.170|187.78.144.170]] ([[User talk:187.78.144.170|talk]]) 19:11, 7 November 2009 (UTC)

Anyone got edition 3 of Volume 2? I have edition 2.

On page 26 of edition 2, it offers a method of random-number generation:

X[n] = X[n-24]+X[n-55] mod m - equation (7)

but says on the next page "The only reason it is difficult to recommend sequence (7) wholeheartedly is that there is still very little theory [about it]"

As it happens, I've discovered some theory and I want to write to DEK about it but only if no-one else has already thought of it. Ergo, my questions:

1) Does edition 3 onwards say that there is any relevant theory not mentioned previously?

2) Does anyone know of any theory, other than what's in edition 3?

== Optimization in chapter 4 ==