Book picks similar to
Thinking about Godel and Turing: Essays on Complexity, 1970-2007 by Gregory Chaitin
mathematics
science
complexity
computers
Mathematics: The Loss of Certainty
Morris Kline - 1980
Mathematics: The Loss of Certainty refutes that myth.
Chaos: A Very Short Introduction
Leonard A. Smith - 2007
Even the simplest system of cause and effect can be subject to chaos, denying us accurate predictions of its behaviour, and sometimes giving rise to astonishing structures of large-scale order. Our growing understanding of Chaos Theory is having fascinating applications in the real world - from technology to global warming, politics, human behaviour, and even gambling on the stock market. Leonard Smith shows that we all have an intuitive understanding of chaotic systems. He uses accessible maths and physics (replacing complex equations with simple examples like pendulums, railway lines, and tossing coins) to explain the theory, and points to numerous examples in philosophy and literature (Edgar Allen Poe, Chang-Tzu, Arthur Conan Doyle) that illuminate the problems. The beauty of fractal patterns and their relation to chaos, as well as the history of chaos, and its uses in the real world and implications for the philosophy of science are all discussed in this Very Short Introduction.
An Introduction to Statistical Learning: With Applications in R
Gareth James - 2013
This book presents some of the most important modeling and prediction techniques, along with relevant applications. Topics include linear regression, classification, resampling methods, shrinkage approaches, tree- based methods, support vector machines, clustering, and more. Color graphics and real-world examples are used to illustrate the methods presented. Since the goal of this textbook is to facilitate the use of these statistical learning techniques by practitioners in science, industry, and other fields, each chapter contains a tutorial on implementing the analyses and methods presented in R, an extremely popular open source statistical software platform. Two of the authors co-wrote The Elements of Statistical Learning (Hastie, Tibshirani and Friedman, 2nd edition 2009), a popular reference book for statistics and machine learning researchers. An Introduction to Statistical Learning covers many of the same topics, but at a level accessible to a much broader audience. This book is targeted at statisticians and non-statisticians alike who wish to use cutting-edge statistical learning techniques to analyze their data. The text assumes only a previous course in linear regression and no knowledge of matrix algebra.
Complexity: The Emerging Science at the Edge of Order and Chaos
M. Mitchell Waldrop - 1992
The science of complexity studies how single elements, such as a species or a stock, spontaneously organize into complicated structures like ecosystems and economies; stars become galaxies, and snowflakes avalanches almost as if these systems were obeying a hidden yearning for order. Drawing from diverse fields, scientific luminaries such as Nobel Laureates Murray Gell-Mann and Kenneth Arrow are studying complexity at a think tank called The Santa Fe Institute. The revolutionary new discoveries researchers have made there could change the face of every science from biology to cosmology to economics. M. Mitchell Waldrop's groundbreaking bestseller takes readers into the hearts and minds of these scientists to tell the story behind this scientific revolution as it unfolds.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael R. Garey - 1979
Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
Simon Singh - 1999
From Mary, Queen of Scots, trapped by her own code, to the Navajo Code Talkers who helped the Allies win World War II, to the incredible (and incredibly simple) logisitical breakthrough that made Internet commerce secure, The Code Book tells the story of the most powerful intellectual weapon ever known: secrecy.Throughout the text are clear technical and mathematical explanations, and portraits of the remarkable personalities who wrote and broke the world’s most difficult codes. Accessible, compelling, and remarkably far-reaching, this book will forever alter your view of history and what drives it. It will also make you wonder how private that e-mail you just sent really is.
Introduction to Mathematical Philosophy
Bertrand Russell - 1918
In it, Russell offers a nontechnical, undogmatic account of his philosophical criticism as it relates to arithmetic and logic. Rather than an exhaustive treatment, however, the influential philosopher and mathematician focuses on certain issues of mathematical logic that, to his mind, invalidated much traditional and contemporary philosophy.In dealing with such topics as number, order, relations, limits and continuity, propositional functions, descriptions, and classes, Russell writes in a clear, accessible manner, requiring neither a knowledge of mathematics nor an aptitude for mathematical symbolism. The result is a thought-provoking excursion into the fascinating realm where mathematics and philosophy meet — a philosophical classic that will be welcomed by any thinking person interested in this crucial area of modern thought.
The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World
Pedro Domingos - 2015
In The Master Algorithm, Pedro Domingos lifts the veil to give us a peek inside the learning machines that power Google, Amazon, and your smartphone. He assembles a blueprint for the future universal learner--the Master Algorithm--and discusses what it will mean for business, science, and society. If data-ism is today's philosophy, this book is its bible.
Dr. Euler's Fabulous Formula: Cures Many Mathematical Ills
Paul J. Nahin - 2006
Dr. Euler's Fabulous Formula shares the fascinating story of this groundbreaking formula--long regarded as the gold standard for mathematical beauty--and shows why it still lies at the heart of complex number theory. This book is the sequel to Paul Nahin's An Imaginary Tale: The Story of I [the square root of -1], which chronicled the events leading up to the discovery of one of mathematics' most elusive numbers, the square root of minus one. Unlike the earlier book, which devoted a significant amount of space to the historical development of complex numbers, Dr. Euler begins with discussions of many sophisticated applications of complex numbers in pure and applied mathematics, and to electronic technology. The topics covered span a huge range, from a never-before-told tale of an encounter between the famous mathematician G. H. Hardy and the physicist Arthur Schuster, to a discussion of the theoretical basis for single-sideband AM radio, to the design of chase-and-escape problems. The book is accessible to any reader with the equivalent of the first two years of college mathematics (calculus and differential equations), and it promises to inspire new applications for years to come. Or as Nahin writes in the book's preface: To mathematicians ten thousand years hence, Euler's formula will still be beautiful and stunning and untarnished by time.
Information: A Very Short Introduction
Luciano Floridi - 2010
In this Very Short Introduction, one of the world's leading authorities on the philosophy of information and on information ethics, Luciano Floridi, offers an illuminating exploration of information as it relates to both philosophy and science. He discusses the roots of the concept of information in mathematics and science, and considers the role of information in several fields, including biology. Floridi also discusses concepts such as "Infoglut" (too much information to process) and the emergence of an information society, and he addresses the nature of information as a communication process and its place as a physical phenomenon. Perhaps more important, he explores information's meaning and value, and ends by considering the broader social and ethical issues relating to information, including problems surrounding accessibility, privacy, ownership, copyright, and open source. This book helps us understand the true meaning of the concept and how it can be used to understand our world.About the Series: Combining authority with wit, accessibility, and style, Very Short Introductions offer an introduction to some of life's most interesting topics. Written by experts for the newcomer, they demonstrate the finest contemporary thinking about the central problems and issues in hundreds of key topics, from philosophy to Freud, quantum theory to Islam.
Relativity: The Special and the General Theory
Albert Einstein - 1916
Having just completed his masterpiece, The General Theory of Relativity—which provided a brand-new theory of gravity and promised a new perspective on the cosmos as a whole—he set out at once to share his excitement with as wide a public as possible in this popular and accessible book.Here published for the first time as a Penguin Classic, this edition of Relativity features a new introduction by bestselling science author Nigel Calder.
The R Book
Michael J. Crawley - 2007
The R language is recognised as one of the most powerful and flexible statistical software packages, and it enables the user to apply many statistical techniques that would be impossible without such software to help implement such large data sets.
Numerical Recipes in C: The Art of Scientific Computing
William H. Press - 1988
In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today.
Elements of Information Theory
Thomas M. Cover - 1991
Readers are provided once again with an instructive mix of mathematics, physics, statistics, and information theory.All the essential topics in information theory are covered in detail, including entropy, data compression, channel capacity, rate distortion, network information theory, and hypothesis testing. The authors provide readers with a solid understanding of the underlying theory and applications. Problem sets and a telegraphic summary at the end of each chapter further assist readers. The historical notes that follow each chapter recap the main points.The Second Edition features: * Chapters reorganized to improve teaching * 200 new problems * New material on source coding, portfolio theory, and feedback capacity * Updated referencesNow current and enhanced, the Second Edition of Elements of Information Theory remains the ideal textbook for upper-level undergraduate and graduate courses in electrical engineering, statistics, and telecommunications.
The Algorithm Design Manual
Steven S. Skiena - 1997
Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide. THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains: * a complete hypertext version of the full printed book. * the source code and URLs for all cited implementations. * over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.