Re: C Books and algorithm books
istillshine@gma il.com wrote:
But often you arrive at simple truths only after long deliberations.
Unfortunately, there are no simple truths in CS... yet.
istillshine@gma il.com wrote:
On Apr 13, 8:51 am, Richard Heathfield <r...@see.sig.i nvalidwrote:
>
I don't think any book is worth of reading for 30 years. Truth is
hidden in simplicity. Anything too complex is superfluous.
>
"?????????????? ????????", as Zhuangzi said.
>
http://en.wikipedia.org/wiki/Zhuangzi
>istillsh...@gm ail.com said:
>>
>>
>>
>>
>Any old book? No. This book? Yes, absolutely. Given the quality of
>the reader, it shows just how much meat there is in TAOCP.
>>
On Apr 12, 3:21 pm, Eric Sosman <esos...@ieee-dot-org.invalid>
wrote:
wrote:
> I have been reading and re-reading and re-re-reading TAOCP
>for more than thirty years
>for more than thirty years
Is it really a good idea to do so: reading a book for more than 30
years?
years?
>Any old book? No. This book? Yes, absolutely. Given the quality of
>the reader, it shows just how much meat there is in TAOCP.
I don't think any book is worth of reading for 30 years. Truth is
hidden in simplicity. Anything too complex is superfluous.
>
"?????????????? ????????", as Zhuangzi said.
>
http://en.wikipedia.org/wiki/Zhuangzi
Unfortunately, there are no simple truths in CS... yet.
Comment