For me, the book takes intellectual effort to absorb. As I was preparing to write this review, I was further impressed with the range of information presented by the authors. I am personally undertaking an investigation of machine learning, artificial intelligence, data mining, etc; The book fit into this investigation. If you have interests in this area (or areas), I think you'll find the book useful. It probably shouldn't have, but the parallels between common human problems and computer programming surprised me. As the book has had a large number of reviewers already, I will highlight some, but far from all, of the topics of each chapter so you may see if they make you curious. While the book speaks of algorithms to live by, the mathematics in the book is highly limited.
Optimal stopping - how many people out of 100 possible candidates should one interview for a given position (including that of spouse)? 37%, Why? Read the book.
The Explore/Exploit dichotomy - Should one ask the question "What's new" or "What's best"? Your answer may depend on your time horizon. As your time horizon shortens, "what's best" may be the better question. The book explains why. The book also looks at the multi-armed bandit as an example of the explore/exploit dichotomy. What's a multi-armed bandit? Think of the one-armed bandit in Vegas and multiply its arms. Mathematicians do so. Their conclusions may be useful. The trials of music critics also fit into the explore/exploit dichotomy. The authors explain why music critics find exploration a chore.
Sorting - libraries are the metaphor for computer sorting. Human memory also requires sorting. Maybe the decline in memory as humans age may be due to the amount of information through which it must sort and not due to declining faculties. A five-year old has a lot less information to go through than a seventy-five year old. The authors consider sorting techniques with email, Yelp, and other common uses. There is much useful information.
Caching - when is forgetting necessary? According to the authors, the first computer cache was developed for a supercomputer in 1962 ub Manchester, England. I wonder how "super" that computer was? Caching allows some information to be stored for repetitive use and uncached information to be kept in the background.
Scheduling - many scheduling problems have "intractable" solutions. The authors suggest different solutions based on algorithms such as precedence constraints, earliest due date (one I personally use frequently, which I couple with a personal likely to get me in the most trouble the quickest test) and shortest processing time. The scheduling problem has received substantial effort from mathematicians.
Bayes's Rule - how to use statistical inference to make useful predictions. Couple a well-defined problem with a range of prior outcomes and one can make accurate guesses. A .300 hitter comes to the plate against the same pitcher who has already struck the batter out twice and it may be a fair guess that the hitter is due for a hit.
Overfitting - don't overthink and over complicate a problem. The authors advise against practicing the idolatry of data. A more complex theorem may well lead to less accuracy rather than more. On the level of incentive compensation, the authors quote Steve Jobs for being careful that you include only those elements in your incentive package that matter; you will get what you measure.
Relaxatrion - the perfect is the enemy of the good. To get any useful answer from your mathematical model, it may be necessary to relax some of your constraints (insisting that your model never allow the traveling salesman to re-enter the same city twice may preclude any answer at all in a time period of less than the remaining life of the universe).
Randomness - mathematicians sometimes realize that the best answer comes from sampling and not from strict calculations. This may explain why I get so many survey requests. Algorithms for prime numbers use this technique. And, apparently, thousands of years ago the Greeks were already looking for prime numbers.
Networking - here the authors examine the "Byzantine generals" problem, which plays a part in explaining how computers communicate with each other.
Game Theory - Alan Turing investigated the "halting problem" in the 1930s. What if you give your computer a problem and it just keeps going? Rock, paper, scissors is a game with which most are familiar. It, too, is part of game theory. When a game seems to have no satisfactory answer, maybe it's time to change the game. What happens when you have an "information cascade"?
If any ot this interests you, I believe that you will enjoy the book. I recommend it highly.
Enjoy fast, free delivery, exclusive deals, and award-winning movies & TV shows with Prime
Try Prime
and start saving today with fast, free delivery
Loading your book clubs
There was a problem loading your book clubs. Please try again.
Not in a club? Learn more
Join or create book clubs
Choose books together
Track your books
Bring your club to Amazon Book Clubs, start a new book club and invite your friends to join, or find a club that’s right for you for free.
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the authors
Something went wrong. Please try your request again later.
Great on Kindle
Great Experience. Great Value.
Putting our best book forward
Each Great on Kindle book offers a great reading experience, at a better value than print to keep your wallet happy.
Explore your book, then jump right back to where you left off with Page Flip.
View high quality images that let you zoom in to take a closer look.
Enjoy features only possible in digital – start reading right away, carry your library with you, adjust the font, create shareable notes and highlights, and more.
Discover additional details about the events, people, and places in your book, with Wikipedia integration.
Get the free Kindle app: 
Enjoy a great reading experience when you borrow the Kindle edition of this book with your Kindle Unlimited membership.
Learn more about Great on Kindle, available in select categories.
Limited-Time Offer
3 Months FREE of Audible Premium Plus. Get this deal
Frequently bought together
$11.99
Get it as soon as Wednesday, Feb 14
In Stock
Total price:
To see our price, add these items to your cart.
Choose items to buy together.
Similar items that may ship from close to you
Page 1 of 1 Start overPage 1 of 1
Popular Highlights in this book
Exploration in itself has value, since trying new things increases our chances of finding the best. So taking the future into account, rather than focusing just on the present, drives us toward novelty.Highlighted by 3,053 Kindle readers- “To try and fail is at least to learn; to fail to try is to suffer the inestimable loss of what might have been.”Highlighted by 2,734 Kindle readers
- This is the first and most fundamental insight of sorting theory. Scale hurts.Highlighted by 1,936 Kindle readers
Reviews with images
Two different book sizes for paperback!
Loved this book so much I ordered 8 for my team as a Christmas present. I ordered paperback the first and second time and to my horror the ones I got for gifts were so much smaller than the first one. Bummer! Print is so small it’s hard to read it and you can’t open the book properly even when force bending it. Hopefully someone from the publisher can see this comment hence the 3 star. Else- content wise I give it 5 stars! As a mathematician and computer scientist, I am happy this book exists. It has been a long time since a popular read has given me this much joy.
Top reviews from other countries
Moises Rangel Silva
Gracias muy buen libro.
Reviewed in Mexico on December 30, 2022
Ignas Selvestravičius
Worth reading several times
Reviewed in Germany on January 7, 2024