![]() ![]() ![]() ![]() regarding the latter, only one book could possibly deserve the nod (Barendregt's The Lambda Calculus), but i doubt 5 people worldwide read the fucker in a given Year of our LORD. (c) since you're trying to minimize your votes (so as not to list overly many), there's an emphasis on broad coverage (ie this felt more like "5-7 computer science books to bring to a desert island surrounded by a faraday cage and anechoic wall") - hence the mandatory inclusion of Knuth and Leon-Garcia (Knuth covers algorithms broadly enough by himself to free up a CLR-ish slot, and you have to know something about networks or you won't be able to piss in modern buildings, let alone write code)īut what about.language design and lambda calculus? the former's too diverse. but it feels a bit applied for this list. (b) I have to list APIUE because I felt we needed an operating systems book, but also a practicum, and also something on design a thorough study of APIUE provides all 3, and also one of the most useful reference books around. anyone hoping to be less more than a theory tyro needs at least Computers and Intractability, Approximation Algorithms, Randomized Algorithms and a satchel's worth of math books (a) you need a basic theory book, but Sipser's not necessarily better than Hopcroft/Ullman, and certainly less complete regarding automata and languages. Hrmmm there's a few reasons why this quiz made me unhappy: ![]()
0 Comments
Leave a Reply. |