7 ms·
> based on its stellar reputation as one of the indispensible, foundational computer science books that every programmer should read. A while back, I was jokin
by Analemma_ 11y ago
> based on its stellar reputation as one of the indispensible, foundational computer science books that every programmer should read.
A while back, I was joking with some friends that TAoCP is to the programming world what Finnegans Wake is to English literature: you're not supposed to read it, nobody's ever actually read it. We all just say we've read it, talk about how brilliant it is, and place it prominently on our office bookshelves to silently humblebrag to anyone who drops by. Sorry you had to spend $178.08 on that lesson, mate.
- Someone 11y agoI read (and understood) volumes 1 to 3 (text, exercises and answers to the exercises, insofar they are present). It is not that hard to read, if you combine it with the right set of university courses in discrete math, combinatorics, and number theory, and some hacking on a 80's home computer (teaches one assembler) Especially without those math courses, I imagine it will be a tougher read, certainly for those grown up with multi-mega or multi-gigabyte machines who expect it to be on programming, not computer science. And it isn't 60's era formalism, it is low-level computer science.
- throwaway999888 11y agoIt's OK. You may display that book prominently and proudly on your cubicle's bookshelf. You've earned it! ;)
- taeric 11y agoAnd 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.
- pklausler 11y agoIn truth, if you haven't actually read Finnegans Wake, you've missed a grand literary experience.
- kens 11y agoI've read Finnegans Wake and view it as almost entirely a waste of time. Maybe that marks me a philistine, but I put a whole lot of effort into the book - reading books about it, listening to two different versions on tape - and it did pretty much nothing for me. And to the original question, I consider TAOCP probably not worth the time and effort to read in detail. It has a lot of interesting stuff if you have infinite time, but very little that I've found practical to me. I've read enough of TAOCP to get two Knuth reward checks but can't motivate myself to read more than a fraction of it.
- petegrif 11y agoYou're right. It's gibberish.
- Someone1234 11y agoIn truth it is an extremely difficult book to read due to its experimental writing style. See for yourself: https://ebooks.adelaide.edu.au/j/joyce/james/j8f/complete.html https://ebooks.adelaide.edu.au/j/joyce/james/j8f/complete.ht...
- acqq 11y agoIt really appears tedious, at best. The explanation is golden: https://en.wikipedia.org/wiki/Finnegans_Wake https://en.wikipedia.org/wiki/Finnegans_Wake "Despite the obstacles, readers and commentators have reached a broad consensus about the book's central cast of characters and, to a lesser degree, its plot. However, a number of key details remain elusive.[6][7]"
- Natsu 11y agoThe first chapter is deliberately impenetrable, using obscure words from many different languages. I've seen commentaries that explain what it's supposed to mean, but it strikes me more as a tall mountain that exists to be climbed. It's more like you're translating it than reading it. That said, if you can convince people to house rule it as a word-source for a Scrabble game, you can terrify people who want to challenge.
- ot 11y ago> "It's a pleasure to meet you, Professor Knuth," Steve [Jobs] said. "I've read all of your books." > "You're full of shit," Knuth responded. (http://www.folklore.org/StoryView.py?story=Close_Encounters_of_the_Steve_Kind.txt http://www.folklore.org/StoryView.py?story=Close_Encounters_...) Yes, now we know that this never happened, but I like to think it did.
- snowwrestler 11y agoHe could respond that way to everyone. In every full set of TAOCP, there is a sentence that reads "If you have read this far, mail this string to the author to collect $25." The sentence is followed by a 10 character alphanumeric string. The string and placement of this sentence is randomized: different in every set. To this day only 3 people have collected their checks. All three have them framed on their walls.
- sjackso 11y agoWow. This sounds like an urban legend (for values of "urban" that mean "university CS departmental"), but I would love to be convinced that it is true.
- jackfoxy 11y agoI'm skeptical. I read the first 3 volumes nearly 20 years ago, skipping only a couple of the most laborious mathy sections and don't recall seeing this.
- deleted 11y ago[deleted]
- screature2 11y agoHmm... I've only ever heard about the reward checks for finding errors in the books. https://en.wikipedia.org/wiki/Knuth_reward_check https://en.wikipedia.org/wiki/Knuth_reward_check
- snowwrestler 11y ago
- deleted 11y ago[deleted]
- deleted 11y ago[deleted]
- TurboHaskal 11y agoI highly doubt people making all these lists recommending SICP, Code Complete and the dragon book have read those either.
- romanhn 11y agoSICP and the dragon book were both part of my CS curriculum. I read Code Complete as a mid-level engineer and found it quite useful. It would not surprise me that many others have done so as well.
- Avalaxy 11y agoCode Complete is very easy to read and good for beginners. SICP on the other hand... I don't think many people actually read that book, it's extremely 'dry'.
- umanwizard 11y agoJames Joyce would probably not have taken kindly to being called "English"