or
Sign in to turn on 1-Click ordering.
or
Amazon Prime free trial required. Sign up when you check out. Learn more
More Buying Choices
Have one to sell? Sell yours here
or
Get a £23.90 Amazon.co.uk Gift Card
Algorithmics: The Spirit of Computing
 
 
Tell the Publisher!
I’d like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Algorithmics: The Spirit of Computing [Paperback]

David Harel , Yishai Feldman
4.0 out of 5 stars  See all reviews (2 customer reviews)
RRP: £61.99
Price: £61.37 & this item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
You Save: £0.62 (1%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In stock.
Dispatched from and sold by Amazon.co.uk. Gift-wrap available.
Only 7 left in stock--order soon (more on the way).
Want guaranteed delivery by Saturday, February 11? Choose Express delivery at checkout. See Details

Formats

Amazon Price New from Used from
Paperback £61.37  
Amazon.co.uk Trade-In Store
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Visit the Amazon.co.uk Trade-In Store for more details.

Frequently Bought Together

Algorithmics: The Spirit of Computing + New Turing Omnibus + The Code Book: The Secret History of Codes and Code-breaking
Price For All Three: £82.53

Show availability and delivery details

Buy the selected items together


Product details

  • Paperback: 536 pages
  • Publisher: Addison Wesley; 3 edition (22 April 2004)
  • Language English
  • ISBN-10: 0321117840
  • ISBN-13: 978-0321117847
  • Product Dimensions: 24 x 18.8 x 2.8 cm
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Bestsellers Rank: 141,283 in Books (See Top 100 in Books)
  • See Complete Table of Contents

More About the Author

David Harel
Discover books, learn about writers, and more.

Visit Amazon's David Harel Page

Product Description

Product Description

The best selling 'Algorithmics' presents the most important, concepts, methods and results that are fundamental to the science of computing.  It starts by introducing the basic ideas of algorithms, including their structures and methods of data manipulation.  It then goes on to demonstrate how to design accurate and efficient algorithms, and discusses their inherent limitations.  As the author himself says in the preface to the book; 'This book attempts to present a readable account of some of the most important and basic topics of computer science, stressing the fundamental and robust nature of the science in a form that is virtually independent of the details of specific computers, languages and formalisms'.

From the Back Cover

From a review of the first edition:

‘This book is a veritable tour de force. Harel writes with uncommon verve, clarity and imagination.'

‘Through the use of tantalizing questions and aptly chosen and often amusing examples, the author transmits to the reader the excitement and intellectual satisfaction of computer science research. Without the use of formal mathematics and without any sacrifice of intellectual integrity, he conveys to the general reader the profound principles on which computer science is founded and which hitherto were only accessible in abstruse and esoteric textbooks and papers.'

‘This is scientific writing at its best.'

Dr Stan Scott, Queen's University Belfast. The Times Higher Education Supplement.

This book tells the story of the concepts, ideas, methods and results fundamental to computer science, in a form independent of the details of specific computers, languages and formalisms. It concerns the true 'spirit' of computers; with the 'recipes' that make them tick - their algorithms.

New to this edition

  • Chapters on software engineering and on reactive systems.
  • Thoroughly revised chapter on programming languages.
  • New material on quantum and molecular computing.
  • Whole text thoroughly updated to include new material on many topics, including abstract data types, the object-oriented paradigm, primality testing, and system verification and validation.

David Harel is Professor and Dean of the Faculty of Mathematics and Computer Science at the Weizmann Institute of Science. He is renowned for outstanding research in many areas of the field, and has recently been awarded the Israel Prize in Computer Science.

Yishai Feldman is on the faculty of the Efi Arazi School of Computer Science at the Interdisciplinary Centre, Herzliya. He specializes in the use of atificial-intelligence techniques in software engineering and its real-world applications.

Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product)
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

What Other Items Do Customers Buy After Viewing This Item?


 

Customer Reviews

2 Reviews
5 star:
 (1)
4 star:    (0)
3 star:
 (1)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (2 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

6 of 7 people found the following review helpful:
5.0 out of 5 stars 'Theoretical Computer Science at 10,000 feet', 24 Jan 2003
By 
Optimistix (New York City) - See all my reviews
As the author says, the members of the research community of Computer
Science have done their discipline a disservice by not making any
special efforts to write accessible accounts of the field, as a result
of which the 'layman' still has little idea of what goes on 'under the
hood', so to say.

He has therefore undertaken the challenging task of presenting the basic
ideas underpinning Computer Science in a way that's easy for the general
reader to grasp. He sets out to present the essential notions of
Algorithms and data structures, Turing machines, Finite state machines,
Decidability, Computability, Complexity, NP-completeness, Correctness,
Parallel algorithms, Probabilistic algorithms, and more with a minimum
of mathematics and yet without sacrificing intellectual rigour - and
most admirably, succeeds in doing so.

David Harel is a big name in Theoretical Computer Science, one of the
leading researchers, and chairman of the Applied Mathematics and
Computer Science Department at the Weizmann Institute of Science.
What made my mind up about reading this book were the strongly encouraging
remarks on the back cover by Aho & Hopcroft, two of the foremost authors
and researchers in the field, who've written some great textbooks themselves.

This book presents all the basic fundamental ideas of the theory of computation,
using as little maths as possible. Yet, the intellectual rigour is never
compromised, which means that the reader truly gets a flavour of how a
Computer Scientist thinks, and how much fun it can be.

It also shows you how certain problems cannot be solved cheaply while others
cannot be solved at all (solved exactly, that is), no matter how much
'computing power' you have - ie theory proves the existence of certain
fundamental limits on the problems that we can hope to solve.

The writing is exceptionally good - like a true master of his subject,
Harel makes concepts seem easy to grasp, though you may find that later
on, you realize it was quite a subtle notion that was discussed.
The illustations are a great help, and occasional humour provides relief
from all the thinking you'll be doing!

Even though it's written for the general reader, it is also useful for
programmers, systems analysts and designers, software engineers and
students, since Harel cuts to the core of the concepts and offers
valuable insights into the theory that they might already know.

All in all, this book covers amazing ground and is a great introduction
to algorithms and the theory of computation. For probing further, you'll
need mathematics and textbooks, but this an excellent starting point.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


6 of 9 people found the following review helpful:
3.0 out of 5 stars Detailed, but heavy going, 9 Dec 2002
It's certainly true that this book goes into a lot of detail about computer science theory. Unfortunately, it is almost all theory, often with little attention paid to the relevance of the topics covered. It can also be rather heavy and hard to follow at times. Overall, I'd say it would be of interest to those studying computer science theory, but perhaps not of much value to those more interested in practical applications.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 4.2 out of 5 stars (11 customer reviews)

21 of 22 people found the following review helpful:
5.0 out of 5 stars A great book!, 24 April 2003
By Scorn ""No joke movement"" - Published on Amazon.com
This review is from: Algorithmics: The Spirit of Computing (Paperback)
This book is the most amazing book on algorithms I've read. The concepts are so well explained that moving to "An introduction to Algorithms by Cormen, Rivest" will be very easy.

I come from a non-computer science background. When I started my coursework in Computer Science I was intimidated with Cormen - (although that IS THE MOST AUTHORITATIVE and a complete text!) until I found Harel.

Harel covers ALL the key aspects of algorithms and quite a bit of Data Structs too. He explains all the concepts in a non-mathematical, yet intellectually stimulating manner.One can literally read through the book in single day and gain insight into the most difficult topics like, unsolvable problems, hard problems, NP and NP complete problems.

On a side note - I pity those reviewers who returned the masterpiece and took objection to Bible quotes. Please grow up and look at what the book has to offer instead of taking objection to such insignificant embellishments


14 of 14 people found the following review helpful:
5.0 out of 5 stars 'Theoretical Computer Science at 10,000 feet', 5 Nov 2001
By Optimistix - Published on Amazon.com
This review is from: Algorithmics: The Spirit of Computing (Paperback)
As the author says, the members of the research community of Computer
Science have done their discipline a disservice by not making any
special efforts to write accessible accounts of the field, as a result
of which the 'layman' still has little idea of what goes on 'under the
hood', so to say.

He has therefore undertaken the challenging task of presenting the basic
ideas underpinning Computer Science in a way that's easy for the general
reader to grasp. He sets out to present the essential notions of
Algorithms and data structures, Turing machines, Finite state machines,
Decidability, Computability, Complexity, NP-completeness, Correctness,
Parallel algorithms, Probabilistic algorithms, and more with a minimum
of mathematics and yet without sacrificing intellectual rigour - and
most admirably, succeeds in doing so.

David Harel is a big name in Theoretical Computer Science, one of the
leading researchers, and chairman of the Applied Mathematics and
Computer Science Department at the Weizmann Institute of Science.
What made my mind up about reading this book were the strongly encouraging
remarks on the back cover by Aho & Hopcroft, two of the foremost authors
and researchers in the field, who've written some great textbooks themselves.

This book presents all the basic fundamental ideas of the theory of computation,
using as little maths as possible. Yet, the intellectual rigour is never
compromised, which means that the reader truly gets a flavour of how a
Computer Scientist thinks, and how much fun it can be.

It also shows you how certain problems cannot be solved cheaply while others
cannot be solved at all (solved exactly, that is), no matter how much
'computing power' you have - ie theory proves the existence of certain
fundamental limits on the problems that we can hope to solve.

The writing is exceptionally good - like a true master of his subject,
Harel makes concepts seem easy to grasp, though you may find that later
on, you realize it was quite a subtle notion that was discussed.
The illustations are a great help, and occasional humour provides relief
from all the thinking you'll be doing!

Even though it's written for the general reader, it is also useful for
programmers, systems analysts and designers, software engineers and
students, since Harel cuts to the core of the concepts and offers
valuable insights into the theory that they might already know.

All in all, this book covers amazing ground and is a great introduction
to algorithms and the theory of computation. For probing further, you'll
need mathematics and textbooks, but this an excellent starting point.


12 of 12 people found the following review helpful:
5.0 out of 5 stars An easy-to-read, for-all-readers algorithms book, 3 Sep 1999
By A Customer - Published on Amazon.com
This review is from: Algorithmics: The Spirit of Computing (Paperback)
This is a truly magnificent book. It comprehensively covers most of the topics in the analysis and design of alogorithms with no mathematical burden to hamper you from getting through this subjet. Later on, you will most probably need a more intensive and mathmetical-analysis oriented book but be sure this second book will be far more easy to go through after you have have finished the "Algorithmics" book. Enjoy it.
 Go to Amazon.com to see all 11 reviews  4.2 out of 5 stars 
Were these reviews helpful?   Let us know
 
 
Only search this product's reviews



Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Listmania!


Look for similar items by category


Look for similar items by subject


Feedback


Amazon.co.uk Privacy Statement Amazon.co.uk Delivery Information Amazon.co.uk Returns & Exchanges