Book picks similar to
Lady Luck: The Theory of Probability by Warren Weaver
mathematics
probability
math
non-fiction
Mathematics and the Imagination
Edward Kasner - 1940
But your pleasure and prowess at games, gambling, and other numerically related pursuits can be heightened with this entertaining volume, in which the authors offer a fascinating view of some of the lesser-known and more imaginative aspects of mathematics.A brief and breezy explanation of the new language of mathematics precedes a smorgasbord of such thought-provoking subjects as the googolplex (the largest definite number anyone has yet bothered to conceive of); assorted geometries — plane and fancy; famous puzzles that made mathematical history; and tantalizing paradoxes. Gamblers receive fair warning on the laws of chance; a look at rubber-sheet geometry twists circles into loops without sacrificing certain important properties; and an exploration of the mathematics of change and growth shows how calculus, among its other uses, helps trace the path of falling bombs.Written with wit and clarity for the intelligent reader who has taken high school and perhaps college math, this volume deftly progresses from simple arithmetic to calculus and non-Euclidean geometry. It “lives up to its title in every way [and] might well have been merely terrifying, whereas it proves to be both charming and exciting." — Saturday Review of Literature.
Introduction to Mathematical Statistics
Robert V. Hogg - 1962
Designed for two-semester, beginning graduate courses in Mathematical Statistics, and for senior undergraduate Mathematics, Statistics, and Actuarial Science majors, this text retains its ongoing features and continues to provide students with background material.
The Art of Computer Programming, Volume 1: Fundamental Algorithms
Donald Ervin Knuth - 1973
-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 thing. -Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http: //msp.org
Hands-On Machine Learning with Scikit-Learn and TensorFlow
Aurélien Géron - 2017
Now that machine learning is thriving, even programmers who know close to nothing about this technology can use simple, efficient tools to implement programs capable of learning from data. This practical book shows you how.By using concrete examples, minimal theory, and two production-ready Python frameworks—Scikit-Learn and TensorFlow—author Aurélien Géron helps you gain an intuitive understanding of the concepts and tools for building intelligent systems. You’ll learn how to use a range of techniques, starting with simple Linear Regression and progressing to Deep Neural Networks. If you have some programming experience and you’re ready to code a machine learning project, this guide is for you.This hands-on book shows you how to use:Scikit-Learn, an accessible framework that implements many algorithms efficiently and serves as a great machine learning entry pointTensorFlow, a more complex library for distributed numerical computation, ideal for training and running very large neural networksPractical code examples that you can apply without learning excessive machine learning theory or algorithm details
The Mathematical Tourist: New & Updated Snapshots of Modern Mathematics
Ivars Peterson - 1988
Now the journey continues in a new, updated edition that includes all the latest information on mathematical proofs, fractals, prime numbers, and chaos, as well as new material on* the relationship between mathematical knots and DNA* how computers based on quantum logic can significantly speed up the factoring of large composite numbers* the relationship between four-dimensional geometry and physical theories of the nature of matter* the application of cellular automata models to social questions and the peregrinations of virtual ants* a novel mathematical model of quasicrystals based on decagon-shaped tilesBlazing a trail through rows of austere symbols and dense lines of formulae, Peterson explores the central ideas behind the work of professional mathematicians-- how and where their pieces of the mathematical puzzle fit in, the sources of their ideas, their fountains of inspiration, and the images that carry them from one discovery to another.
Euclid's Elements
Euclid
Heath's translation of the thirteen books of Euclid's Elements. In keeping with Green Lion's design commitment, diagrams have been placed on every spread for convenient reference while working through the proofs; running heads on every page indicate both Euclid's book number and proposition numbers for that page; and adequate space for notes is allowed between propositions and around diagrams. The all-new index has built into it a glossary of Euclid's Greek terms.Heath's translation has stood the test of time, and, as one done by a renowned scholar of ancient mathematics, it can be relied upon not to have inadvertantly introduced modern concepts or nomenclature. We have excised the voluminous historical and scholarly commentary that swells the Dover edition to three volumes and impedes classroom use of the original text. The single volume is not only more convenient, but less expensive as well.
Gödel's Proof
Ernest Nagel - 1958
Gödel received public recognition of his work in 1951 when he was awarded the first Albert Einstein Award for achievement in the natural sciences--perhaps the highest award of its kind in the United States. The award committee described his work in mathematical logic as "one of the greatest contributions to the sciences in recent times."However, few mathematicians of the time were equipped to understand the young scholar's complex proof. Ernest Nagel and James Newman provide a readable and accessible explanation to both scholars and non-specialists of the main ideas and broad implications of Gödel's discovery. It offers every educated person with a taste for logic and philosophy the chance to understand a previously difficult and inaccessible subject.New York University Press is proud to publish this special edition of one of its bestselling books. With a new introduction by Douglas R. Hofstadter, this book will appeal students, scholars, and professionals in the fields of mathematics, computer science, logic and philosophy, and science.
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.
Vector Mechanics for Engineers: Statics
Ferdinand P. Beer - 1977
Following on the success of the first six editions of the series, this work introduces theoretical and pedagogical innovations in statics, dynamics, and mechanics of materials education.
Zero: The Biography of a Dangerous Idea
Charles Seife - 2000
For centuries, the power of zero savored of the demonic; once harnessed, it became the most important tool in mathematics. Zero follows this number from its birth as an Eastern philosophical concept to its struggle for acceptance in Europe and its apotheosis as the mystery of the black hole. Today, zero lies at the heart of one of the biggest scientific controversies of all time, the quest for the theory of everything. Elegant, witty, and enlightening, Zero is a compelling look at the strangest number in the universe and one of the greatest paradoxes of human thought.
Computational Complexity
Sanjeev Arora - 2007
Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.
Arithmetic
Paul Lockhart - 2017
But from the perspective of mathematics, groupings of ten are arbitrary, and can have serious shortcomings. Twelve would be better for divisibility, and eight is smaller and well suited to repeated halving. Grouping by two, as in binary code, has turned out to have its own remarkable advantages.Paul Lockhart reveals arithmetic not as the rote manipulation of numbers--a practical if mundane branch of knowledge best suited for balancing a checkbook or filling out tax forms--but as a set of ideas that exhibit the fascinating and sometimes surprising behaviors usually reserved for higher branches of mathematics. The essence of arithmetic is the skillful arrangement of numerical information for ease of communication and comparison, an elegant intellectual craft that arises from our desire to count, add to, take away from, divide up, and multiply quantities of important things. Over centuries, humans devised a variety of strategies for representing and using numerical information, from beads and tally marks to adding machines and computers. Lockhart explores the philosophical and aesthetic nature of counting and of different number systems, both Western and non-Western, weighing the pluses and minuses of each.A passionate, entertaining survey of foundational ideas and methods, Arithmetic invites readers to experience the profound and simple beauty of its subject through the eyes of a modern research mathematician.
Structure and Interpretation of Computer Programs
Harold Abelson - 1984
This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.
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."
Introducing Mathematics: A Graphic Guide
Ziauddin Sardar - 1995
It affects us all. We depend on it in our daily lives, and yet many of the tools of mathematics, such as geometry, algebra and trigonometry, are descended from ancient or non-Western civilizations.Introducing Mathematics traces the story of mathematics from the ancient world to modern times, describing the great discoveries and providing an accessible introduction to such topics as number-systems, geometry and algebra, the calculus, the theory of the infinite, statistical reasoning and chaos theory. It shows how the history of mathematics has seen progress and paradox go hand in hand - and how this is still happening today.