Ask HN: Is Knuth's TAOCP worth the time and effort?
I'm starting the first volume.
Right at the start, Knuth introduces Induction Mathematical Proof, and more specifically tries to show that we can describe it as an `algorithm mathematical proof`.
I showed it to a friend who is quite good at math, and he told me the book may be trying too hard especially in the examples variety, and how it might not be needed for comprehension's sake.
Would you still recommend this book, and if yes, in what circumstances?
I showed it to a friend who is quite good at math, and he told me the book may be trying too hard especially in the examples variety, and how it might not be needed for comprehension's sake.
Would you still recommend this book, and if yes, in what circumstances?