Algorithms Are Not Enough

Why a new approach is needed in the quest for general artificial intelligence. Since the inception of artificial intelligence, we have been warned about the imminent arrival of computational systems that can replicate human thought processes. Before we know it, computers will become so intelligent that humans will be lucky to kept as pets. And yet, although artificial intelligence has become increasingly sophisticated--with such achievements as driverless cars and humanless chess-playing--computer science has not yet created general artificial intelligence. In Algorithms Are Not Enough, Herbert Roitblat explains how artificial general intelligence may be possible and why a robopocalypse is neither imminent, nor likely.

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

A Wharton professor and tech entrepreneur examines how algorithms and artificial intelligence are starting to run every aspect of our lives, and how we can shape the way they impact us Through the technology embedded in almost every major tech platform and every web-enabled device, algorithms and the artificial intelligence that underlies them make a staggering number of everyday decisions for us, from what products we buy, to where we decide to eat, to how we consume our news, to whom we date, and how we find a job. We've even delegated life-and-death decisions to algorithms--decisions once made by doctors, pilots, and judges. In his new book, Kartik Hosanagar surveys the brave new world of algorithmic decision-making and reveals the potentially dangerous biases they can give rise to as they increasingly run our lives. He makes the compelling case that we need to arm ourselves with a better, deeper, more nuanced understanding of the phenomenon of algorithmic thinking. And he gives us a route in, pointing out that algorithms often think a lot like their creators--that is, like you and me. Hosanagar draws on his experiences designing algorithms professionally--as well as on history, computer science, and psychology--to explore how algorithms work and why they occasionally go rogue, what drives our trust in them, and the many ramifications of algorithmic decision-making. He examines episodes like Microsoft's chatbot Tay, which was designed to converse on social media like a teenage girl, but instead turned sexist and racist; the fatal accidents of self-driving cars; and even our own common, and often frustrating, experiences on services like Netflix and Amazon. A Human's Guide to Machine Intelligence is an entertaining and provocative look at one of the most important developments of our time and a practical user's guide to this first wave of practical artificial intelligence.

A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition New chapters on matchings in bipartite graphs, online algorithms, and machine learning New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays 140 new exercises and 22 new problems Reader feedback–informed improvements to old problems Clearer, more personal, and gender-neutral writing style Color added to improve visual presentation Notes, bibliography, and index updated to reflect developments in the field Website with new supplementary material Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.

A bestselling author, neuroscientist, and computer engineer unveils a theory of intelligence that will revolutionize our understanding of the brain and the future of AI. For all of neuroscience's advances, we've made little progress on its biggest question: How do simple cells in the brain create intelligence? Jeff Hawkins and his team discovered that the brain uses maplike structures to build a model of the world—not just one model, but hundreds of thousands of models of everything we know. This discovery allows Hawkins to answer important questions about how we perceive the world, why we have a sense of self, and the origin of high-level thought. A Thousand Brains heralds a revolution in the understanding of intelligence. It is a big-think book, in every sense of the word. One of the Financial Times' Best Books of 2021 One of Bill Gates' Five Favorite Books of 2021

We have effective theories for very few things. Gravity is one, electromagnetism another. But for most things—whether as mundane as finding a mate or as major as managing an economy—our theories are lousy or nonexistent. Fortunately, we don't need them, any more than a fish needs a theory of water to swim; we're able to muddle through. But how do we do it? In Probably Approximately Correct, computer scientist Leslie Valiant presents a theory of the theoryless. The key is “probably approximately correct” learning, Valiant's model of how anything can act without needing to understand what is going on. The study of probably approximately correct algorithms reveals the shared computational nature of evolution and cognition, indicates how computers might possess authentic intelligence, and shows why hacking a problem can be far more effective than developing a theory to explain it. After all, finding a mate is a lot more satisfying than finding a theory of mating. Offering an elegant, powerful model that encompasses all of life's complexity, Probably Approximately Correct will revolutionize the way we look at the universe's greatest mysteries.

This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: • Doubles the tutorial material and exercises over the first edition • Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video • Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them • Includes several NEW "war stories" relating experiences from real-world applications • Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

Introduces machine learning and its algorithmic paradigms, explaining the principles behind automated learning approaches and the considerations underlying their usage.