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):||15 March 2013|
|PDF File Size:||14.76 Mb|
|ePub File Size:||18.23 Mb|
|Price:||Free* [*Free Regsitration Required]|
Kewan rated it liked it Jan 25, Even professional programmers and systems analysts might lack the background or motivation required to get through books aimed at full-time computer science students.
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. Lars Fischer rated it really liked it Sep 23, While the main issues raised there still stand strong e. Computers are made of bits and bytes, and programming is carried out using languages with rigid rules of grammar and punctuation.
Want to Read saving…. In terms of the basic fundamentals of algorithmics that is, if we exclude the more practical and faster-changing material of Chapters 3, 13, and 14 little in the book has to be changed. If you like books and love to build cool products, we may be looking for you. Jake rated it really liked it Aug 25, Thus, even had we decided to go for a fully-fledged new edition of the book, rather than merely a new printing, the text would have undergone only relatively minor changes.
Rather than taking this as a criticism of the field, I think that it shows that the topics selected for inclusion in the book are really of fundamental nature, so that no significant changes had to be made.
Algorithmics: The Spirit of Computing
All this comes as no surprise. J rated it really liked it Jun 23, In modern terms this work would be considered part of systems biology or bioinformatics, topics that are not discussed in the present book. Many advanced textbooks do treat the fundamentals, but by their very nature they concentrate on specific topics, cpmputing do so at an advanced technical level that is usually unsuitable for the general reader.
Scores of excellent books can be found on computers themselves, with details of their structure, workings, and operation. However, despite the dizzying speed with which some of the technological innovations become obsolete and are replaced by new ones, the fundamentals of the science of computation, and hence many of the basic concepts that are considered important in a computer science curriculum, change slowly, if at all.
This book is an attempt in this direction.
Prof. David Harel – Books
These topics may be considered to be additional forms of parallelism, albeit more radical ones. Part Three of the book th devoted to the inherent limitations of effectively executable algorithms, and hence of the computers that implement them.
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. Paul rated it really liked it Aug dpirit, Twelve years in Computer Science is almost an eternity The interested reader can find lots of relevant material in comphting many articles and books written about him.
However, Watson is strongly based on statistical techniques rather than classical knowledge representation, continuing the trend discussed towards the end of Chapter The main changes are as follows: Preface written for the Printing.
In that respect, Turing’s name is associated with both the Church-Turing thesis and the Turing machine, two of the most fundamental notions discussed in these chapters. Turing also carried out pioneering work on morphogenesis and the way patterns are formed in the process. This style of programming is not appropriate for every problem, but it lends itself very well to parallelization. These include significant improvements in computerized chess, and great improvements in natural language understanding and translation.
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 present edition contains numerous exercises, as well as solutions to about a third of them.
It is not specifically about computer technology, nor is it about computer programming, though obviously it is heavily influenced by both.
As to randomized and probabilistic algorithms, the topic of Chapter 11, there has been a lot of interesting research done in recent years, much of it around the random classes RP and BPP and their connections to pseudo-random number generators. A good book with good substance about the Algorithm field and the chapters about Probabilistic Algorithms and Algorithmics and Inteligence is a good reference to start.
Thus, chances are that the subject matter of this book will only become more relevant and of more interest.
Teaching a course based exclusively on it was possible, but would have required that the instructor prepare exercises and add examples and more detail in certain places. Four cores per chip are common these days, and the numbers are expected to increase drastically, at the expense of single-core performance. In a sense, these altorithmics are not integral parts of the topic of the book — algorithmics — and hence in teaching a course based on the book these should probably be assigned as homework reading.
It is about what shall be called algorithmics in this book, that is, the study of algorithms. Parallelism is thus becoming an even more computng and crucial topic in computer science, so that it is probably fair to say that resolving the algorihmics problems in this area has become a lot more urgent.
Hernan Soulages rated it it was amazing Sep 10,