Let Over Lambda


Doug Hoyte - 2008
    Starting with the fundamentals, it describes the most advanced features of the most advanced language: Common Lisp. Only the top percentile of programmers use lisp and if you can understand this book you are in the top percentile of lisp programmers. If you are looking for a dry coding manual that re-hashes common-sense techniques in whatever langue du jour, this book is not for you. This book is about pushing the boundaries of what we know about programming. While this book teaches useful skills that can help solve your programming problems today and now, it has also been designed to be entertaining and inspiring. If you have ever wondered what lisp or even programming itself is really about, this is the book you have been looking for.

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.

The Quantum Universe: Everything That Can Happen Does Happen


Brian Cox - 2011
    Cox and Forshaw's contention? There is no need for quantum mechanics to be viewed this way. There is a lot of mileage in the 'weirdness' of the quantum world, and it often leads to confusion and, frankly, bad science. The Quantum Universe cuts through the Wu Li and asks what observations of the natural world made it necessary, how it was constructed, and why we are confident that, for all its apparent strangeness, it is a good theory.The quantum mechanics of The Quantum Universe provide a concrete model of nature that is comparable in its essence to Newton’s laws of motion, Maxwell’s theory of electricity and magnetism, and Einstein’s theory of relativity.

Godel: A Life Of Logic, The Mind, And Mathematics


John L. Casti - 2000
    His Incompleteness Theorem turned not only mathematics but also the whole world of science and philosophy on its head. Equally legendary were Gö's eccentricities, his close friendship with Albert Einstein, and his paranoid fear of germs that eventually led to his death from self-starvation. Now, in the first popular biography of this strange and brilliant thinker, John Casti and Werner DePauli bring the legend to life. After describing his childhood in the Moravian capital of Brno, the authors trace the arc of Gö's remarkable career, from the famed Vienna Circle, where philosophers and scientists debated notions of truth, to the Institute for Advanced Study in Princeton, New Jersey, where he lived and worked until his death in 1978. In the process, they shed light on Gö's contributions to mathematics, philosophy, computer science, artificial intelligence -- even cosmology -- in an entertaining and accessible way.

But How Do It Know? - The Basic Principles of Computers for Everyone


J. Clark Scott - 2009
    Its humorous title begins with the punch line of a classic joke about someone who is baffled by technology. It was written by a 40-year computer veteran who wants to take the mystery out of computers and allow everyone to gain a true understanding of exactly what computers are, and also what they are not. Years of writing, diagramming, piloting and editing have culminated in one easy to read volume that contains all of the basic principles of computers written so that everyone can understand them. There used to be only two types of book that delved into the insides of computers. The simple ones point out the major parts and describe their functions in broad general terms. Computer Science textbooks eventually tell the whole story, but along the way, they include every detail that an engineer could conceivably ever need to know. Like Momma Bear's porridge, But How Do It Know? is just right, but it is much more than just a happy medium. For the first time, this book thoroughly demonstrates each of the basic principles that have been used in every computer ever built, while at the same time showing the integral role that codes play in everything that computers are able to do. It cuts through all of the electronics and mathematics, and gets right to practical matters. Here is a simple part, see what it does. Connect a few of these together and you get a new part that does another simple thing. After just a few iterations of connecting up simple parts - voilà! - it's a computer. And it is much simpler than anyone ever imagined. But How Do It Know? really explains how computers work. They are far simpler than anyone has ever permitted you to believe. It contains everything you need to know, and nothing you don't need to know. No technical background of any kind is required. The basic principles of computers have not changed one iota since they were invented in the mid 20th century. "Since the day I learned how computers work, it always felt like I knew a giant secret, but couldn't tell anyone," says the author. Now he's taken the time to explain it in such a manner that anyone can have that same moment of enlightenment and thereafter see computers in an entirely new light.

Designing Data-Intensive Applications


Martin Kleppmann - 2015
    Difficult issues need to be figured out, such as scalability, consistency, reliability, efficiency, and maintainability. In addition, we have an overwhelming variety of tools, including relational databases, NoSQL datastores, stream or batch processors, and message brokers. What are the right choices for your application? How do you make sense of all these buzzwords?In this practical and comprehensive guide, author Martin Kleppmann helps you navigate this diverse landscape by examining the pros and cons of various technologies for processing and storing data. Software keeps changing, but the fundamental principles remain the same. With this book, software engineers and architects will learn how to apply those ideas in practice, and how to make full use of data in modern applications. Peer under the hood of the systems you already use, and learn how to use and operate them more effectively Make informed decisions by identifying the strengths and weaknesses of different tools Navigate the trade-offs around consistency, scalability, fault tolerance, and complexity Understand the distributed systems research upon which modern databases are built Peek behind the scenes of major online services, and learn from their architectures

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 Art and Craft of Problem Solving


Paul Zeitz - 1999
    Readers are encouraged to do math rather than just study it. The author draws upon his experience as a coach for the International Mathematics Olympiad to give students an enhanced sense of mathematics and the ability to investigate and solve problems.

The Principles of Mathematics


Bertrand Russell - 1903
    Russell's classic The Principles of Mathematics sets forth his landmark thesis that mathematics and logic are identical―that what is commonly called mathematics is simply later deductions from logical premises.His ideas have had a profound influence on twentieth-century work on logic and the foundations of mathematics.

Dialogues on Mathematics


Alfréd Rényi - 1967
    

The Calculus Gallery: Masterpieces from Newton to Lebesgue


William Dunham - 2004
    This book charts its growth and development by sampling from the work of some of its foremost practitioners, beginning with Isaac Newton and Gottfried Wilhelm Leibniz in the late seventeenth century and continuing to Henri Lebesgue at the dawn of the twentieth--mathematicians whose achievements are comparable to those of Bach in music or Shakespeare in literature. William Dunham lucidly presents the definitions, theorems, and proofs. Students of literature read Shakespeare; students of music listen to Bach, he writes. But this tradition of studying the major works of the masters is, if not wholly absent, certainly uncommon in mathematics. This book seeks to redress that situation.Like a great museum, The Calculus Gallery is filled with masterpieces, among which are Bernoulli's early attack upon the harmonic series (1689), Euler's brilliant approximation of pi (1779), Cauchy's classic proof of the fundamental theorem of calculus (1823), Weierstrass's mind-boggling counterexample (1872), and Baire's original category theorem (1899). Collectively, these selections document the evolution of calculus from a powerful but logically chaotic subject into one whose foundations are thorough, rigorous, and unflinching--a story of genius triumphing over some of the toughest, most subtle problems imaginable.Anyone who has studied and enjoyed calculus will discover in these pages the sheer excitement each mathematician must have felt when pushing into the unknown. In touring The Calculus Gallery, we can see how it all came to be.

Grokking Algorithms An Illustrated Guide For Programmers and Other Curious People


Aditya Y. Bhargava - 2015
    The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. If you want to take a hard pass on Knuth's brilliant but impenetrable theories and the dense multi-page proofs you'll find in most textbooks, this is the book for you. This fully-illustrated and engaging guide makes it easy for you to learn how to use algorithms effectively in your own programs.Grokking Algorithms is a disarming take on a core computer science topic. In it, you'll learn how to apply common algorithms to the practical problems you face in day-to-day life as a programmer. You'll start with problems like sorting and searching. As you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression or artificial intelligence. Whether you're writing business software, video games, mobile apps, or system utilities, you'll learn algorithmic techniques for solving problems that you thought were out of your grasp. For example, you'll be able to:Write a spell checker using graph algorithmsUnderstand how data compression works using Huffman codingIdentify problems that take too long to solve with naive algorithms, and attack them with algorithms that give you an approximate answer insteadEach carefully-presented example includes helpful diagrams and fully-annotated code samples in Python. By the end of this book, you will know some of the most widely applicable algorithms as well as how and when to use them.

Python Machine Learning


Sebastian Raschka - 2015
    We are living in an age where data comes in abundance, and thanks to the self-learning algorithms from the field of machine learning, we can turn this data into knowledge. Automated speech recognition on our smart phones, web search engines, e-mail spam filters, the recommendation systems of our favorite movie streaming services – machine learning makes it all possible.Thanks to the many powerful open-source libraries that have been developed in recent years, machine learning is now right at our fingertips. Python provides the perfect environment to build machine learning systems productively.This book will teach you the fundamentals of machine learning and how to utilize these in real-world applications using Python. Step-by-step, you will expand your skill set with the best practices for transforming raw data into useful information, developing learning algorithms efficiently, and evaluating results.You will discover the different problem categories that machine learning can solve and explore how to classify objects, predict continuous outcomes with regression analysis, and find hidden structures in data via clustering. You will build your own machine learning system for sentiment analysis and finally, learn how to embed your model into a web app to share with the world

Computer Age Statistical Inference: Algorithms, Evidence, and Data Science


Bradley Efron - 2016
    'Big data', 'data science', and 'machine learning' have become familiar terms in the news, as statistical methods are brought to bear upon the enormous data sets of modern science and commerce. How did we get here? And where are we going? This book takes us on an exhilarating journey through the revolution in data analysis following the introduction of electronic computation in the 1950s. Beginning with classical inferential theories - Bayesian, frequentist, Fisherian - individual chapters take up a series of influential topics: survival analysis, logistic regression, empirical Bayes, the jackknife and bootstrap, random forests, neural networks, Markov chain Monte Carlo, inference after model selection, and dozens more. The distinctly modern approach integrates methodology and algorithms with statistical inference. The book ends with speculation on the future direction of statistics and data science.

Geometry, Relativity and the Fourth Dimension


Rudolf Rucker - 1977
    A remarkable pictorial discussion of the curved space-time we call home, it achieves even greater impact through the use of 141 excellent illustrations. This is the first sustained visual account of many important topics in relativity theory that up till now have only been treated separately.Finding a perfect analogy in the situation of the geometrical characters in Flatland, Professor Rucker continues the adventures of the two-dimensional world visited by a three-dimensional being to explain our three-dimensional world in terms of the fourth dimension. Following this adventure into the fourth dimension, the author discusses non-Euclidean geometry, curved space, time as a higher dimension, special relativity, time travel, and the shape of space-time. The mathematics is sound throughout, but the casual reader may skip those few sections that seem too purely mathematical and still follow the line of argument. Readable and interesting in itself, the annotated bibliography is a valuable guide to further study.Professor Rucker teaches mathematics at the State University of New York in Geneseo. Students and laymen will find his discussion to be unusually stimulating. Experienced mathematicians and physicists will find a great deal of original material here and many unexpected novelties. Annotated bibliography. 44 problems.