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):||26 January 2008|
|PDF File Size:||5.55 Mb|
|ePub File Size:||14.71 Mb|
|Price:||Free* [*Free Regsitration Required]|
Well-established academic disciplines have if habit of yielding excellent textbooks, and computer science is no exception. Naes rated it it was amazing Sep 16, Sam Wong rated it it was amazing Oct 17, These topics may be considered to be additional forms of parallelism, albeit more radical ones.
It is hoped that his book will facilitate communication between the various groups of people who are actively involved in the computer revolution, and between that group, and those who, for the time being, are observers only.
The first noticeable difference is that for this revision I needed real help I wish I had read this when studying for my dabid. Thanks for telling us about the problem. Indeed, computer science is a fast-growing academic discipline, with ever-larger numbers of potential students knocking at the doors of admission offices.
Davif modern terms this work would be considered part of systems biology or bioinformatics, topics that are not discussed in the present book.
Scores of excellent books can be found on computers themselves, with details of their structure, workings, and operation.
Algorithmics: The Spirit of Computing by David Harel
In Hael Four of the book the requirements are relaxed, for example, by employing concurrent activities or coin tossingin order to overcome some of these difficulties.
It is about what shall be called algorithmics in this book, that is, the study of algorithms. The limits of computing constitute a central thread of the book, to which Chapters 8 and 9 are devoted.
Have computer scientists been idle during the five years since the first edition was published? It thus represents a very general concept, with numerous applications. Most of the material in the preliminary Part One should be familiar to people with a background in programming. On a more personal level, but without getting into any details here, I would like to add that large parts of my own research in the last 38 years can davkd viewed as very modest continuations and extensions of the work of Turing.
What relevance this will have to the fundamental issues of quantum computation discussed in the text remains to be seen.
Algorithmics: The Spirit Of Computing (3rd Edition) – David Harel, Yishai Feldman
Part V The Bigger Picture ends with the closing chapter of the previous editions, “Algorithms and Intelligence,” which is now Th Certain sections contain relatively technical material and can be skipped by the reader without too much loss of continuity.
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. With the stage thus set, the first chapter of Part Two turns to some general methods and paradigms for algorithmic design. Lars Fischer rated it really liked it Sep algorithmisc, It would seem that things cannot be explained without first describing, in computig, either a machine or a medium for communicating with one or both.
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.
Chapter 12 is devoted to cryptography, and although Turing’s work is not mentioned there explicitly, it played a classical and crucial part in the development of the field.
Just a moment while we sign you in to your Goodreads account.
None of the central open problems therein have been resolved, none of the basic notions underlying the topics therein have undergone a major modification, and very few of the new notions that have been defined since seem to deserve a place alongside the fundamental ones that are included.
Colin Jones rated it really liked it Nov 27, The material covered herein, while not directly aimed at producing algorithnics 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.
Algorithmics: The Spirit of Computing
Paperbackpages. J rated it really liked it Jun 23, The last chapter of the book, Chapter 15, on artificial intelligence and heuristics, is the one that could really do with a facelift. This is followed by two chapters on the analysis algofithmics algorithms, treating, respectively, their correctness and efficiency mainly time efficiencyincluding techniques for establishing the former and estimating the latter. It is recommended, however, that even those sections be skimmed, at least to get a superficial idea of their contents.