Turing's Cathedral: The Origins of the Digital Universe


George Dyson - 2012
    In Turing’s Cathedral, George Dyson focuses on a small group of men and women, led by John von Neumann at the Institute for Advanced Study in Princeton, New Jersey, who built one of the first computers to realize Alan Turing’s vision of a Universal Machine. Their work would break the distinction between numbers that mean things and numbers that do things—and our universe would never be the same. Using five kilobytes of memory (the amount allocated to displaying the cursor on a computer desktop of today), they achieved unprecedented success in both weather prediction and nuclear weapons design, while tackling, in their spare time, problems ranging from the evolution of viruses to the evolution of stars. Dyson’s account, both historic and prophetic, sheds important new light on how the digital universe exploded in the aftermath of World War II. The proliferation of both codes and machines was paralleled by two historic developments: the decoding of self-replicating sequences in biology and the invention of the hydrogen bomb. It’s no coincidence that the most destructive and the most constructive of human inventions appeared at exactly the same time.  How did code take over the world? In retracing how Alan Turing’s one-dimensional model became John von Neumann’s two-dimensional implementation, Turing’s Cathedral offers a series of provocative suggestions as to where the digital universe, now fully three-dimensional, may be heading next.

The Prime Number Conspiracy: The Biggest Ideas in Math from Quanta


Thomas Lin - 2018
    The stories show that, as James Gleick puts it in the foreword, "inspiration strikes willy-nilly." One researcher thinks of quantum chaotic systems at a bus stop; another suddenly realizes a path to proving a theorem of number theory while in a friend's backyard; a statistician has a "bathroom sink epiphany" and discovers the key to solving the Gaussian correlation inequality. Readers of The Prime Number Conspiracy, says Quanta editor-in-chief Thomas Lin, are headed on "breathtaking intellectual journeys to the bleeding edge of discovery strapped to the narrative rocket of humanity's never-ending pursuit of knowledge."Quanta is the only popular publication that offers in-depth coverage of the latest breakthroughs in understanding our mathematical universe. It communicates mathematics by taking it seriously, wrestling with difficult concepts and clearly explaining them in a way that speaks to our innate curiosity about our world and ourselves. Readers of this volume will learn that prime numbers have decided preferences about the final digits of the primes that immediately follow them (the "conspiracy" of the title); consider whether math is the universal language of nature (allowing for "a unified theory of randomness"); discover surprising solutions (including a pentagon tiling proof that solves a century-old math problem); ponder the limits of computation; measure infinity; and explore the eternal question "Is mathematics good for you?"ContributorsAriel Bleicher, Robbert Dijkgraaf, Kevin Hartnett, Erica Klarreich, Thomas Lin, John Pavlus, Siobhan Roberts, Natalie WolchoverCopublished with Quanta Magazine

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.

A Textbook of Engineering Mathematics


N.P. Bali - 2010
    The salient features of the book are as follows: It exactly covers the prescribed syllabus. Nothing undesirable has been included and nothing essential has been left. Its approach is explanatory and language is lucid and communicable. The exposition of the subject matter is systematic and the students are better prepared to solve the problems. All fundamentals of the included topics are explained with a micro-analysis. Sufficient number of solved examples have been given to let the students understand the various skills necessary to solve the problems. These examples are well-graded. Unsolved exercises of multi-varieties have been given in a well-graded style. Attempting those on his own, will enable a student to create confidence and independence in him/her regarding the understanding of the subject. Daily life problems and practical applications have been incorporated in the body of the text. A large number of attractive and accurate figures have been drawn which enable a student to grasp the subject in an easier way. All the answers have been checked and verified. About The Author: N.P. Bali is a prolific author of over 100 books for degree and engineering students. He has been writing books for more than forty years. His books on the following topics are well known for their easy comprehension and lucid presentation: Algebra, Trigonometry, Differential Calculus, Integral Calculus, Real Analysis, Co-ordinate Geometry, Statics, Dynamics etc. Dr. Manish Goyal has been associated with

Advanced Engineering Mathematics


K.A. Stroud - 2003
    You proceed at your own rate and any difficulties you may encounter are resolved before you move on to the next topic. With a step-by-step programmed approach that is complemented by hundreds of worked examples and exercises, Advanced Engineering Mathematics is ideal as an on-the-job reference for professionals or as a self-study guide for students.Uses a unique technique-oriented approach that takes the reader through each topic step-by-step.Features a wealth of worked examples and progressively more challenging exercises.Contains Test Exercises, Learning Outcomes, Further Problems, and Can You? Checklists to guide and enhance learning and comprehension.Expanded coverage includes new chapters on Z Transforms, Fourier Transforms, Numerical Solutions of Partial Differential Equations, and more Complex Numbers.Includes a new chapter, Introduction to Invariant Linear Systems, and new material on difference equations integrated into the Z transforms chapter.

How to Prove It: A Structured Approach


Daniel J. Velleman - 1994
    The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5

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.

Foundations of Complex Analysis


S. Ponnusamy - 2002
    Suitable for a two semester course in complex analysis, or as a supplementary text for an advanced course in function theory, this book aims to give students a good foundation of complex analysis and provides a basis for solving problems in mathematics, physics, engineering and many other sciences.

Calculus: The Classic Edition


Earl W. Swokowski - 1991
    Groundbreaking in every way when first published, this book is a simple, straightforward, direct calculus text. It's popularity is directly due to its broad use of applications, the easy-to-understand writing style, and the wealth of examples and exercises which reinforce conceptualization of the subject matter. The author wrote this text with three objectives in mind. The first was to make the book more student-oriented by expanding discussions and providing more examples and figures to help clarify concepts. To further aid students, guidelines for solving problems were added in many sections of the text. The second objective was to stress the usefulness of calculus by means of modern applications of derivatives and integrals. The third objective, to make the text as accurate and error-free as possible, was accomplished by a careful examination of the exposition, combined with a thorough checking of each example and exercise.

Humble Pi: A Comedy of Maths Errors


Matt Parker - 2019
    Most of the time this math works quietly behind the scenes . . . until it doesn't. All sorts of seemingly innocuous mathematical mistakes can have significant consequences.Math is easy to ignore until a misplaced decimal point upends the stock market, a unit conversion error causes a plane to crash, or someone divides by zero and stalls a battleship in the middle of the ocean.Exploring and explaining a litany of glitches, near misses, and mathematical mishaps involving the internet, big data, elections, street signs, lotteries, the Roman Empire, and an Olympic team, Matt Parker uncovers the bizarre ways math trips us up, and what this reveals about its essential place in our world. Getting it wrong has never been more fun.

Elements of the Theory of Computation


Harry R. Lewis - 1981
    The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. KEY TOPICS: In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

Concrete Mathematics: A Foundation for Computer Science


Ronald L. Graham - 1988
    "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems."

The Elements of Statistical Learning: Data Mining, Inference, and Prediction


Trevor Hastie - 2001
    With it has come vast amounts of data in a variety of fields such as medicine, biology, finance, and marketing. The challenge of understanding these data has led to the development of new tools in the field of statistics, and spawned new areas such as data mining, machine learning, and bioinformatics. Many of these tools have common underpinnings but are often expressed with different terminology. This book describes the important ideas in these areas in a common conceptual framework. While the approach is statistical, the emphasis is on concepts rather than mathematics. Many examples are given, with a liberal use of color graphics. It should be a valuable resource for statisticians and anyone interested in data mining in science or industry. The book's coverage is broad, from supervised learning (prediction) to unsupervised learning. The many topics include neural networks, support vector machines, classification trees and boosting—the first comprehensive treatment of this topic in any book. Trevor Hastie, Robert Tibshirani, and Jerome Friedman are professors of statistics at Stanford University. They are prominent researchers in this area: Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie wrote much of the statistical modeling software in S-PLUS and invented principal curves and surfaces. Tibshirani proposed the Lasso and is co-author of the very successful An Introduction to the Bootstrap. Friedman is the co-inventor of many data-mining tools including CART, MARS, and projection pursuit.

The Visual Display of Quantitative Information


Edward R. Tufte - 1983
    Theory and practice in the design of data graphics, 250 illustrations of the best (and a few of the worst) statistical graphics, with detailed analysis of how to display data for precise, effective, quick analysis. Design of the high-resolution displays, small multiples. Editing and improving graphics. The data-ink ratio. Time-series, relational graphics, data maps, multivariate designs. Detection of graphical deception: design variation vs. data variation. Sources of deception. Aesthetics and data graphical displays. This is the second edition of The Visual Display of Quantitative Information. Recently published, this new edition provides excellent color reproductions of the many graphics of William Playfair, adds color to other images, and includes all the changes and corrections accumulated during 17 printings of the first edition.

The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine


Charles Petzold - 2008
    Turing Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be "computable," creating the field of computability theory in the process, a foundation of present-day computer programming.The book expands Turing's original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing's statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others.Interwoven into the narrative are the highlights of Turing's own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41.