Price: $0.99
(as of Oct 05, 2026 05:58:49 UTC – Details)
A fascinating exploration of how computer algorithms can be applied to our everyday lives, helping to solve common decision-making problems and illuminate the workings of the human mind
All our lives are constrained by limited space and time, limits that give rise to a particular set of problems. What should we do, or leave undone, in a day or a lifetime? How much messiness should we accept? What balance of new activities and familiar favorites is the most fulfilling? These may seem like uniquely human quandaries, but they are not: computers, too, face the same constraints, so computer scientists have been grappling with their version of such problems for decades. And the solutions they’ve found have much to teach us.
In a dazzlingly interdisciplinary work, acclaimed author Brian Christian (who holds degrees in computer science, philosophy, and poetry, and works at the intersection of all three) and Tom Griffiths (a UC Berkeley professor of cognitive science and psychology) show how the simple, precise algorithms used by computers can also untangle very human questions. They explain how to have better hunches and when to leave things to chance, how to deal with overwhelming choices and how best to connect with others. From finding a spouse to finding a parking spot, from organizing one’s inbox to understanding the workings of human memory, Algorithms to Live By transforms the wisdom of computer science into strategies for human living.
Listening Length : 11 hours and 50 minutes
Author : Brian Christian, see all
Narrator : Brian Christian
Publication date : April 19, 2016
Language : English
Publisher : Brilliance Audio
ASIN : B01D24NAL6
Version : Unabridged
Program Type : Audiobook
Best Sellers Rank: #4,753 in Audible Books & Originals (See Top 100 in Audible Books & Originals) #8 in Computer Science (Books) #17 in Medical Cognitive Psychology #18 in Computer Science (Audible Books & Originals)
Customer Reviews: 4.5 4.5 out of 5 stars (6,639) var dpAcrHasRegisteredArcLinkClickAction; P.when(‘A’, ‘ready’).execute(function(A) { if (dpAcrHasRegisteredArcLinkClickAction !== true) { dpAcrHasRegisteredArcLinkClickAction = true; A.declarative( ‘acrLink-click-metrics’, ‘click’, { “allowLinkDefault”: true }, function (event) { if (window.ue) { ue.count(“acrLinkClickCount”, (ue.count(“acrLinkClickCount”) || 0) + 1); } } ); } }); P.when(‘A’, ‘cf’).execute(function(A) { A.declarative(‘acrStarsLink-click-metrics’, ‘click’, { “allowLinkDefault” : true }, function(event){ if(window.ue) { ue.count(“acrStarsLinkWithPopoverClickCount”, (ue.count(“acrStarsLinkWithPopoverClickCount”) || 0) + 1); } }); });
Customers find the book informative, illustrating how computer science can be applied to human decision-making, and appreciate how it describes algorithms in detail. Moreover, the writing quality is well-received, with one customer highlighting the masterful final chapter on Game Theory. However, the readability and clarity receive mixed feedback – while some find it easy to read, others say it’s not the easiest read, and while some find the explanations clear, others find them vague and sparse. Additionally, the relevance of the content is also mixed, with some finding it highly relevant while others note that much of the math content isn’t directly applicable to daily life.
