Sudoku. Literate. Knuth: Programs. I write lots of CWEB programs, primarily for my own edification. If there is sufficient interest, I'll make a large subset of them available via the Internet. For now, I'm listing only a few. The first two show (by quite different methods) that exactly 2,432,932 knight's tours are unchanged by 180-degree rotation of the chessboard. The third was used to compute some of the tables in Axioms and Hulls that several people have asked about. The fourth was used in one of my otherwise unpublished lectures in the Computer Musings series.
The next few were requested by members of the Academy of Recreational Mathematicians in Japan. And so on. Note: Many of my programs, including the first two samples, use the conventions and library of The Stanford GraphBase. Enumerates symmetrical Hamiltonian cycles (December 1992) Enumerates perfect matchings of bipartite graphs (May 1996) REFLECT; also a change file for REFLECT Enumerates equivalence classes of reflection networks, aka CC systems (January 1991)
Computer Musings by Professor Donald E. Knuth. Why I run away from Knuth. May 8, 2008 at 5:54 pm | Posted in History, Programming | 15 Comments Tags: books, Programming, software someone named Greg commented on this post, very politely, that I am wrong in saying that Maths is not necessary. you can see his full comment in the comments after the post but I have quoted things here and have edited my original post to present a more fundamental answer to his questions. Donald Knuth . Nearly every programmer, at some point of his life has got hit by this name or truly I should say got intimidated by his way of presenting algorithms. Many programmers think that he has wrongly titled his book as “The Art of Computer Programming”, though I don’t agree with them. Most programmers get scared when they look at his book. Heck, when, in 2002, I saw his book for 1st time, I thought, they were Mathematics books. He is Quite academic. 1.) Then you will come to know what I am talking about.
If you don’t know then I want to tell you that Donald Knuth is a child-prodigy. Interview with Donald Knuth. Andrew Binstock and Donald Knuth converse on the success of open source, the problem with multicore architecture, the disappointing lack of interest in literate programming, the menace of reusable code, and that urban legend about winning a programming contest with a single compilation. Andrew Binstock: You are one of the fathers of the open-source revolution, even if you aren’t widely heralded as such. You previously have stated that you released TeX as open source because of the problem of proprietary implementations at the time, and to invite corrections to the code—both of which are key drivers for open-source projects today. Have you been surprised by the success of open source since that time? Donald Knuth: The success of open source code is perhaps the only thing in the computer field that hasn’t surprised me during the past several decades. Remember, though, that my opinion on economic questions is highly suspect, since I’m just an educator and scientist.
Interview with Donald Knuth.