Book Summary · Brian Christian, Tom Griffiths · 2016
Algorithms to Live By: Summary
A computer-science lens on human decisions: when to stop searching, when to explore, how to sort, and why good enough is often optimal.
Key takeaways from Algorithms to Live By
The ideas readers on HourLife upvote the most, in order.
-
1
The right time to stop searching is usually earlier than your anxiety wants and later than your impatience wants.
Optimal stopping reframes commitment as a rule, not a mood. Sample enough to learn the field, then stop making every new option reopen the whole decision.
-
2
Explore when information is still changing your model. Exploit when novelty is only delaying courage.
The explore/exploit tradeoff explains why curiosity and consistency both matter. The mistake is treating one as a virtue in every season.
-
3
Sorting is not free. Sometimes a little mess is the price of moving quickly.
The book gives permission to stop over-organizing low-value areas. Order pays only when retrieval happens often enough to justify the setup cost.
-
4
Memory works better when it keeps the recently useful close and lets stale things drift away.
Caching turns forgetfulness into a design principle. A desk, calendar, reading list, or relationship rhythm should privilege what actually recurs.
-
5
Satisficing is not settling. It is respecting the cost of computation.
Perfect answers require time, attention, and opportunity cost. The smarter move is often a clear threshold, not another round of comparison.
-
6
Overfitting happens in life whenever you design a rule around yesterday's noise.
The machine-learning lesson is deeply human: a rule can match the past too closely and become useless for the future. Simpler models often travel better.
-
7
A calendar is a scheduling algorithm wearing social clothes.
Shortest-job-first, context switching, and priority queues make daily planning less moralistic. Many productivity failures are queue-design failures.
-
8
Computational kindness means making the next person's problem easier to solve.
Clear defaults, fewer choices, better labels, and clean handoffs are not just etiquette. They reduce the mental workload imposed on everyone downstream.
How to apply Algorithms to Live By
Turn the ideas into something you can do this week.
Write a Stopping Rule First
Before your next search, define the sample size, the minimum acceptable bar, and the point where you will stop comparing. Do this before seeing more options.
Run One Explore Batch
Pick an uncertain area and gather a small batch of new signals: five apartments, three career conversations, or ten customer interviews. Then decide what changed.
Stop Sorting Low-Value Clutter
Choose one area where organization has become procrastination. Sort only the items you retrieve weekly and leave the rest in a simple catch-all system.
Build a Personal Cache
Move the tools, notes, people, and decisions you reuse most into the easiest access layer. Let rarely used material require an extra step.
Lower the Proof Burden for Reversible Choices
Mark a decision as reversible or irreversible. If it is reversible, set a good-enough threshold and choose faster than your perfectionism prefers.
Audit Your Queue
List today's tasks by duration and context switching cost. Batch the similar ones, clear a few short jobs, then protect one long uninterrupted block.
A good algorithm does not make life mechanical. It gives judgment a sharper edge and anxiety a smaller job.