6 ms·
And this shows a huge folly in our industry. Short answer, is the book easy? Of course not. Is it dated in approach? Yes. Sorta. What would make it better
by taeric 11y ago
And this shows a huge folly in our industry.
Short answer, is the book easy? Of course not. Is it dated in approach? Yes. Sorta. What would make it better? A modern language? Why?
Consider, just yesterday there was someone designing an elevator system using python. That is literally one of the first examples in TAoCP.
Not long ago, there was an article about how linear search with sentinel values is actually faster than binary search for many data sets. This is, again, one of the first treatments of searches in this text.
I'm waiting for someone to rediscover that you can make a tree for depth first traversal, such that you do not need to use a stack. Again, one of the early topics in these books. Curious about different characteristics of Tries/Trees/Lists/Hashes?...
Is it worth the time to read end to end? Almost certainly not. The math heavy sections are definitely going to scare off a lot of people. Myself included. This mainly means to skim the exercises.
But, there is a lot to offer in the industry of programming. Knuth picked an order to offer this information and is going in that order. The latest topics he is just now getting to are hugely relevant in many endeavors and I recommend people at least be aware of them.
- davidw 11y ago> But, there is a lot to offer in the industry of programming. Knuth picked an order to offer this information and is going in that order. Perhaps it's sacrilege, but I've always considered it kind of weird to take on a project like TAOCP in a field that's growing far faster than it can be documented by one person.
- rubiquity 11y agoThe fundamentals of computation remain the same.
- davidw 11y agoCertainly, I realize he's not writing about the cool new library for Python or something, but even just looking at actual computer science stuff, the field is expanding rapidly.
- pmelendez 11y ago> "but even just looking at actual computer science stuff, the field is expanding rapidly." Is it though? Hash tables - 1953, Red-Black trees 1972, Quicksort 1959, etc...
- davidw 11y agoLook at Knuth's future book plans, and consider all the things he's not putting in them that are current. He's also revisited the books some, and plans to do so again in the future. I don't mean to take away from the books - they're beautiful and full of a lot of timeless knowledge. There's just something that seems a bit ... I can't even find a word for it ... about the endeavor.
- jessedhillon 11y agoIt would really help if you could list some specific ways that the theory of computation has changed since the writing of TAOCP, and some evidence for why you think that theoretical CS is changing faster than can be documented.
- davidw 11y agoTAOCP has not been written, several volumes of it have. It remains to be seen whether Knuth will even be able to finish what he set out to do, let alone include new things. > faster than can be documented. By one person, I wrote. Here's one that I think is interesting, difficult and evolving: distributed systems. This shows interesting work happening with version vectors, for instance, over the past 15 years: https://en.wikipedia.org/wiki/Version_vector https://en.wikipedia.org/wiki/Version_vector
- marvy 11y agoNo need to worry about that one. Looking at Wikipedia's list of volume's, looks like distributed systems are not being covered. But I agree with you anyway. Let's quote the man himself (taken from his website): "As I continue to write Volumes 4 and 5, I'll need to refer to topics that belong logically in Volumes 1--3 but weren't invented yet when I wrote those books". He plans to complete Volume 5 by 2025. Tune in ten years from now to see how it goes.
- agumonkey 11y agoSometimes I believe it strongly, sometimes I don't. Do deep fundamental, mathematical analysis help in the accidental social complexity found on programming stacks sometimes ?
- S4M 11y agoLast time realized that basic algebra (equivalence relation and classes) were helping me to solve a concrete programming problem I was having (having something to do with syntactic trees). It was a big surprise to me. Equivalence relations are a simple concept [0], and maybe my problem could have been solved without thinking of it, but still, some fundamental math helped me for my problem, and I was stunned by that. [0] https://en.wikipedia.org/wiki/Equivalence_relation https://en.wikipedia.org/wiki/Equivalence_relation
- agumonkey 11y agoI believe this kind of problems are already far away from most people's job and one foot in the math side of programming.
- agumonkey 11y agoAlso, I didn't want to diminish your point. When you understand the value of mathematical abstractions for any kind of tasks it's a bliss.
- S4M 11y agoIn fact those situations are pretty rare, it was the first time it happened to me that a mathematical concept helped me to understand how to write a certain algorithm that isn't specifically mathy (as opposite to implement something purely math related), so I would that, sadly, your previous comment is on the point.
- vram22 11y agoGuts. Also (you probably know): "The unreasonable man ..." - Shaw (GBS) https://en.m.wikiquote.org/wiki/George_Bernard_Shaw https://en.m.wikiquote.org/wiki/George_Bernard_Shaw
- brudgers 11y agoMy suspicion is that the growth rate of computer science is partially due to Knuth's work. TAoCP has a fair amount of original research in it and Knuth developed tools like the Stanford Graph Base, original algorithms, and original numerical methods as part of his research for the book...and TeX and Metafont for it's publication.