D. Harel, Algorithmics: The Spirit of Computing, Addison-Wesley, Reading, MA, 1st edition, ; 2nd edition, 3rd edition (with Y. Feldman), Special . D. Harel, Algorithmics: The Spirit of Computing, Addison-Wesley, Reading, MA, 2nd edition, ; 3rd edition, (with Y. Feldman). (1st edn.: Dutch. Algorithmics has 74 ratings and 4 reviews. Alon said: I read this book when I was 14, and it was for me the introduction to computer science, (and anythi.
|Published (Last):||23 February 2010|
|PDF File Size:||14.41 Mb|
|ePub File Size:||10.98 Mb|
|Price:||Free* [*Free Regsitration Required]|
Well-established academic disciplines have a habit of yielding excellent textbooks, and computer science is no exception. Tony rated it really liked it Jul 09, Twelve years in Computer Science is almost an eternity Akgorithmics Jones rated it really liked it Nov 27, It is recommended, however, that even those sections be skimmed, at least to get a superficial idea of their contents.
Algorithmics: The Spirit of Computing by David Harel
One well-known example is IBM’s Watson machine, which beat the top two human contestants in Jeopardy! Parallelism is thus becoming an even more central and crucial topic in computer science, so that it is probably fair to say that resolving the open problems in this area has become a lot more urgent. Dutch, ; Hebrew Open University Press; 2nd edn.: Lists with This Book. Chapter 1 is an introduction, the bulk of Chapter 3 is really just a brief survey of several programming languages, and Chapter 12 is a nontechnical account of some topics in artificial intelligence.
I read this book when I was 14, and it was for me the introduction to computer science, and anything related to programming.
Algorithmics: The Spirit of Computing
Besides these more noticeable changes, the entire text has been brought up to date in many less subtle and more subtle ways. It would appear that anyone associated with computers ought to be aware of these topics, and not only those who have decided to spend three yhe four years getting a particular kind of academic diploma.
It is not specifically about computer technology, nor is it about computer programming, though obviously it is heavily influenced by both. Turing’s test for computerized artificial intelligence is also central to the book and is discussed in detail towards its end, in Chapter The next few paragraphs contain very brief discussions about a few of the relevant things that have happened in the last few years thanks to Uri Feige for helping me compile this list, and, of course, to my co-author Yishai Feldman.
Four cores per chip are common these days, and the numbers are expected to increase drastically, at the expense of single-core performance. There are discussions on abstract data types, on the non-approximability of certain NP-complete problems, on probabilistically checkable proofs, and, of course, on the brand new AKS polynomial-time algorithm for primality.
The second new chapter zeros in on the particular difficulties arising in the special case of reactive systems, as a result of their complex behavior over time. The material covered herein, while not directly aimed at producing better programmers or system analysts, can aid people who work with computers by providing an overall picture of some of the most fundamental issues relevant to their work.
Second and comouting editions were published in andrespectively with Yishai Feldman joining the “team” for the 3rd edition.
The preliminary chapters discuss the concept of an algorithmic problem and the algorithm that solves it, followed by cursory discussions of the structure of algorithms, the data they manipulate, and the languages in which they are programmed. What relevance this will have to the fundamental issues of quantum computation discussed in the text remains to be seen.
Worse still, it is shown that some problems are provably not solvable algorithjics computers at all, even with unlimited time!
The algorithmice can read these now or come back to them after reading the book itself. And all I can say about these is this: The final chapter has been modified in many places too, e.
Algorithmics: The Spirit Of Computing (3rd Edition) – David Harel, Yishai Feldman
These techniques seem to have great potential for intelligent search in areas such as medicine, law, and others. However, by and large, there is almost universal agreement on a core of fundamental topics that computer science students should be taught.
Naes rated it it was amazing Sep 16, Parallelism, as discussed in the first parts of Chapter 10, has become more and more crucial recently, in part because of the change in hardware algorihtmics. Sense Hofstede rated it liked it Jan 03, Its principal interest and use, however, is in those areas where the process is to be carried out by a computer. Oct 07, Alan rated it off liked it.
Certain sections contain relatively technical material and can be skipped by the reader without too much loss of continuity. The field is hugely consequential: The book now has five Parts, rather than four.
Polish,; 3rd edn.: Thus, even had we decided to go algorlthmics a fully-fledged new edition of the book, rather than merely a new printing, the text would have undergone only relatively minor changes.