ismitley: This is a pretty neat book, that explains a lot of difficult concepts in technology in an easier to grasp manner. Things like P=NP and Big O get covered. read comments

andyljones: Far more readable than the usual text (Cormen), the first half is a guide on how to select and design algorithms for the problems you encounter, and the second half is a whistle-stop tour... read comments

throwaway124567: Very good. It was MITs old CS textbook, it’s still highly relevant. It takes a while to get through and you probably would get the most value out of it if you already have a lot of programming experience. read comments

OJFord: It covers automata and languages, computability, and complexity - and is brilliantly written, the proof style in particular: clear 'proof idea's followed by the details that can be easily skipped... read comments

rhizome31: For a gentle introduction to algorithms and Big O, "Grokking Algorithms" is easy to read and fun. read comments

beat: Only a madman would actually read them all, but they're good to have to remind you that there are mountains you can't even begin to climb. read comments

thecleaner: It has a balance between theory and practice. Plus it has a lots and lots of exercises which I found very helpful for practising. read comments

apricot: I read it while in high school and it made me decide to learn computer science. It has 50 short chapters on things like RSA cryptography, the halting problem, logic circuits, perceptrons. read comments

jonjacky: Not a textbook, but a more popular Scientific American level treatment. Very readable and accessible but quite rigorous also - Harel's a noted computer scientist. read comments

robto: Starting at logic gates and moving up through the levels of abstraction until you can build a programming language and implement a video game is the most fundamental approach that I'm aware of. read comments

emodendroket: Most people do algorithms in school. I learned about it while I was already writing programs for money all day, which means it deeply impacted the way I think about my work. read comments

qubex: A totally astounding introduction to how computing fits into the broader scale of understanding other phenomena in our everyday scientific lives — and, unlike most... read comments

carapace: IMO this is the most concise yet accessible gateway to the inner Mysteries of Computer Programming. Read between the lines, the prime thesis is implied not explicit. read comments

BFatts: A fantastic language-agnostic manual that still applies heavily today. read comments

gshubert17: It's a good book for CS students who want overviews of less familiar areas of computer science, and for anyone (in other areas) who want to know more about computation. read comments

mindcrime: If you didn't take, or have forgotten, classes like Computer Architecture or Digital Logic, this is a great book for getting your head around the low level details of what's happening in side a digital computer... read comments