Here are 66 books that The Golden Ticket fans have personally recommended if you like
The Golden Ticket.
Book DNA is a community of 12,000+ authors and super readers sharing their favorite books with the world.
I’m a mathematics professor who ended up writing the internationally bestselling novel The Death of Vishnu (along with two follow-ups) and became better known as an author. For the past decade and a half, I’ve been using my storytelling skills to make mathematics more accessible (and enjoyable!) to a broad audience. Being a novelist has helped me look at mathematics in a new light, and realize the subject is not so much about the calculations feared by so many, but rather, about ideas. We can all enjoy such ideas, and thereby learn to understand, appreciate, and even love math.
A primary reason to love math is because of its usefulness. This book shows two sides of math’s applicability, since it is so ubiquitously used in various algorithms.
On the one hand, such usage can be good, because statistical inferences can make our life easier and enrich it. On the other, when these are not properly designed or monitored, it can lead to catastrophic consequences. Mathematics is a powerful force, as powerful as wind or fire, and needs to be harnessed just as carefully.
Cathy O’Neil’s message in this book spoke deeply to me, reminding me that I need to be always vigilant about the subject I love not being deployed carelessly.
'A manual for the 21st-century citizen... accessible, refreshingly critical, relevant and urgent' - Financial Times
'Fascinating and deeply disturbing' - Yuval Noah Harari, Guardian Books of the Year
In this New York Times bestseller, Cathy O'Neil, one of the first champions of algorithmic accountability, sounds an alarm on the mathematical models that pervade modern life -- and threaten to rip apart our social fabric.
We live in the age of the algorithm. Increasingly, the decisions that affect our lives - where we go to school, whether we get a loan, how much we pay for insurance - are being made…
It is April 1st, 2038. Day 60 of China's blockade of the rebel island of Taiwan.
The US government has agreed to provide Taiwan with a weapons system so advanced that it can disrupt the balance of power in the region. But what pilot would be crazy enough to run…
Once upon a time, I was a computer science researcher, working in the research labs of companies like Microsoft and Hewlett-Packard. Later I started teaching computer science to college students and writing books about algorithms. I love computers and I love algorithms. Most of all, I love explaining algorithms to other people. In fact, one of my most important missions in life is to advance the public understanding of computer science and algorithms. So if you read any of the books on my list, you’ll bring me one step closer to achieving my mission. Go ahead, read one now!
A graphic novel about Ada Lovelace, Charles Babbage, and their quixotic Victorian escapades designing computers and algorithms nearly a century before their time? As fascinating as that may already sound, it’s only the beginning. This is the only graphic novel I’ve read that has footnotes to the footnotes—immensely amusing footnotes. While reading this book, I feel constantly in the presence of insane genius. (But please read this book on physical paper. It is a work of art.)
Winner of the British Book Design and Production Award for Graphic Novels Winner of the Neumann Prize in the History of Mathematics
In The Thrilling Adventures of Lovelace and Babbage Sydney Padua transforms one of the most compelling scientific collaborations into a hilarious set of adventures
Meet two of Victorian London's greatest geniuses... Ada Lovelace, daughter of Lord Byron: mathematician, gambler, and proto-programmer, whose writings contained the first ever appearance of general computing theory, a hundred years before an actual computer was built. And Charles Babbage, eccentric inventor of the Difference Engine, an enormous clockwork calculating machine that would have…
Saying just the right words in just the right way can cause a box of electronics to behave however you want it to behave… that’s an idea that has captivated me ever since I first played around with a computer at Radio Shack back in 1979. I’m always on the lookout for compelling ways to convey the topic to people who are open-minded, but maybe turned off by things that are overly technical. I teach computer science and study artificial intelligence as a way of expanding what we can get computers to do on our behalf.
I always find myself applying algorithmic thinking in my everyday life—it affects the way I put away dishes, navigate to the store, and organize my to-do lists. And I think others could benefit from that mindset.
So, when I read this book, my reaction was "Yes! That's what I want people to know. I just wish I could have said it that well!" The authors (who I know, but didn't know they wrote a book together), did a fantastic job of selecting algorithms with deep human connections. Really! And they explain them just right, without getting too mathematical but while still hitting the key ideas with clarity and accuracy. Fantastic!
A fascinating exploration of how computer algorithms can be applied to our everyday lives.
In this dazzlingly interdisciplinary work, acclaimed author Brian Christian and cognitive scientist Tom Griffiths show us how the simple, precise algorithms used by computers can also untangle very human questions. Modern life is 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? The authors explain how to have better hunches and when to leave things to chance, how to deal…
A Duke with rigid opinions, a Lady whose beliefs conflict with his, a long disputed parcel of land, a conniving neighbour, a desperate collaboration, a failure of trust, a love found despite it all.
Alexander Cavendish, Duke of Ravensworth, returned from war to find that his father and brother had…
Once upon a time, I was a computer science researcher, working in the research labs of companies like Microsoft and Hewlett-Packard. Later I started teaching computer science to college students and writing books about algorithms. I love computers and I love algorithms. Most of all, I love explaining algorithms to other people. In fact, one of my most important missions in life is to advance the public understanding of computer science and algorithms. So if you read any of the books on my list, you’ll bring me one step closer to achieving my mission. Go ahead, read one now!
In a world full of buzzwords about the latest AI algorithms, Leslie Valiant is one of the few authors who can shrug off the hype and deliver something truly profound. Valiant is a Turing Award winner whose work has changed the face of computational learning theory. His ideas show how algorithms can arise naturally, as part of evolution. (He calls them ecorithms.) These ideas are stunningly original. I admire Valiant’s no-nonsense prose style immensely—it’s such a pleasure to read something where the ideas and explanations are simultaneously so clear and so deep that they provide their own star power.
From a leading computer scientist, a unifying theory that will revolutionize our understanding of how life evolves and learns.How does life prosper in a complex and erratic world? While we know that nature follows patterns,such as the law of gravity,our everyday lives are beyond what known science can predict. We nevertheless muddle through even in the absence of theories of how to act. But how do we do it?In Probably Approximately Correct , computer scientist Leslie Valiant presents a masterful synthesis of learning and evolution to show how both individually and collectively we not only survive, but prosper in a…
I’ve spent most of my life writing code—and too much of that life teaching new programmers how to write code like a professional. If it’s true that you only truly understand something after teaching it to someone else, then at this point I must really understand programming! Unfortunately, that understanding has not led to an endless stream of bug-free code, but it has led to some informed opinions on programming and books about programming.
Yes, it’s a textbook, albeit a particularly well-written one. You may already have it on your shelf, if you’ve taken a programming class or two.
I’m way too old to have used CLRS as a textbook, though! For me, it’s an effectively bottomless collection of neat little ideas—an easy-to-describe problem, then a series of increasingly clever ways to solve that problem. How often do I end up using one of those algorithms? Not very often! But every time I read the description of an algorithm, I get a nugget of pure joy from the “aha” moment when I first understand how it works.
My life has been about programming for as long as I can remember. Learning to code was a way to connect with my dad and express my creativity at a young age. Since I grew up with code, it became the way I understood the world; often I could look at a process or program and immediately see its source code in my mind. I developed a very strong sense of aesthetics searching for “perfect code,” which for me was code that was not only error-free but resistant to errors. My studies, research, and career is about moving myself and all programmers closer to that goal: Software that never fails.
The building blocks of software are algorithms, so here our journey continues after you have established a deep understanding of programming languages.
Modern software is predominantly distributed, and since this book doesn't assume much it is the perfect introduction to algorithm analysis, concurrency, and distributed systems. And the best part is that you can just jump in and build these algorithms yourself.
The new edition of a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models.
This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to…
The Duke's Christmas Redemption
by
Arietta Richmond,
A Duke who has rejected love, a Lady who dreams of a love match, an arranged marriage, a house full of secrets, a most unneighborly neighbor, a plot to destroy reputations, an unexpected love that redeems it all.
Lady Charlotte Wyndham, given in an arranged marriage to a man she…
I have been working with computers for decades now – having started with programmable handheld calculators and working my way up and down through mainframes, mini- and micro-computers. I always thought there is an art to writing software, and that good software can be read and admired. Maintainability, readability, and testability are some core needs for software, and after going through many programming paradigms, I feel that functional programming (FP) is the way to go – and several modern web frameworks agree. JavaScript (and now, TypeScript) are essential to web development, and I wanted to show how FP could be successfully used with those languages, and thus my book.
This book is essential in that it follows a systematic and scientific approach to software development, advocating for clarity in expressing algorithms, providing a rigorous framework for designing and reasoning about programs, and, fundamentally, always focusing on formal methods and mathematical techniques to ensure correctness and efficiency in programming code.
Most importantly, the book doesn’t just show you how to prove programs correct, but also teaches how to arrive from a definition to an efficient and correct solution, so I would recommend this to every developer.
I build and use emerging technological innovations in business, and I also teach others how they might too! I’m a serial entrepreneur and a Professor at the Wharton School of the University of Pennsylvania. As an entrepreneur, I co-founded and developed the core IP for Yodle Inc, a venture-backed firm that was acquired by Web.com. I’m now the founder of Jumpcut Media – a startup using data and Web3 technologies to democratize opportunities in Film and TV. In all this work, I'm often trying to assess how emerging technologies may affect business and society in the long run and how I can apply them to create new products and services.
This book provides an excellent description of the various kinds of machine learning approaches and asks the question of whether there will be a Master Algorithm, one single (universal) algorithm that learns all kinds of tasks from data. The author, Pedro Domingos, introduces the different approaches to building intelligence and the research tribes exploring them – Symbolists (with its foundations in Philosophy and Logic), Connectionists (foundations in Neuro/Cognitive Science), Evolutionaries (foundations in Evolutionary Biology), Bayesians (statistical foundations), and Analogizers (Psychology). He also introduces some of his own ideas on what the master machine learning algorithm might look like. It’s a really useful primer for those who are not deeply immersed in machine learning but it’s written for readers with at least a basic engineering and computer science background.
Algorithms increasingly run our lives. They find books, movies, jobs, and dates for us, manage our investments, and discover new drugs. More and more, these algorithms work by learning from the trails of data we leave in our newly digital world. Like curious children, they observe us, imitate, and experiment. And in the world's top research labs and universities, the race is on to invent the ultimate learning algorithm: one capable of discovering any knowledge from data, and doing anything we want, before we even ask.Machine learning is the automation of discovery,the scientific method on steroids,that enables intelligent robots and…
I am Professor of Computer Science at Stony Brook University, and have spent the past thirty years thinking/teaching/writing about algorithms. Algorithms are the really cool thing about computer science, for they form the ideas behind any interesting computer program. And algorithms turn out to be the ideas behind many interesting aspects of life that have nothing to do with computers. I have written six books on algorithms, programming, gambling, and history –including the ranking of the historical significance of all the people in Wikipedia.
Knuth’s unique mix of playfulness and rigor came to define computer science as an intellectual discipline: computer science didn’t really have anything to do with computers, but everything to do with a particular way of seeing the world. Just browse and wonder at the beauty and precision achieved in these books.
Volume 3 (Sorting and Searching) is my personal favorite, and I encourage you to start there. During the pandemic, I finally got around to reading Volume 4A (Combinatorial Algorithms), which was published thirty plus years after Volume 3. It was the same feeling I had watching the movie The Phantom Menace years after growing up with the original Star Wars trilogy. I had forgotten just how unique and distinctive Knuth’s Art of Computer Programming is.
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.
-Byte, September 1995
I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.
-Charles Long
If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole…
This book follows the journey of a writer in search of wisdom as he narrates encounters with 12 distinguished American men over 80, including Paul Volcker, the former head of the Federal Reserve, and Denton Cooley, the world’s most famous heart surgeon.
In these and other intimate conversations, the book…
I have been working with computers for decades now – having started with programmable handheld calculators and working my way up and down through mainframes, mini- and micro-computers. I always thought there is an art to writing software, and that good software can be read and admired. Maintainability, readability, and testability are some core needs for software, and after going through many programming paradigms, I feel that functional programming (FP) is the way to go – and several modern web frameworks agree. JavaScript (and now, TypeScript) are essential to web development, and I wanted to show how FP could be successfully used with those languages, and thus my book.
This multi-volume book is, for me, a masterpiece that goes far beyond just coding or algorithms or data structures, and serves as a profound exploration of algorithmic thinking and computer science's theoretical foundations, going deeply into the performance of algorithms and the behavior of data structures.
Knuth's meticulous approach, coupled with his clear and engaging prose (with occasional touches of humor) clearly explains complex concepts, and shows a deep understanding of the artistry inherent in solving computational problems.
Bill Gates said that anybody who went through all its volumes would get a job at his company, and I surely agree! I would recommend this book both for novice or seasoned programmers, because you will always find invaluable insights in it.
Check out the boxed set that brings together Volumes 1 - 4B in one elegant case.
The Art of Computer Programming, Volumes 1-4B Boxed Set
ISBN: 9780137935109
Art of Computer Programming, Volume 1, Fascicle 1, The: MMIX -- A RISC Computer for the New Millennium
This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at…