With jampacked pages and a full-color illustration for each entry, the book, opened anywhere, is a call to action. (And it’s guaranteed to make you smarter.) Twelve basic categories include Geometry, Patterns, Numbers, Logic and Probability, and Perception. An easy-to-read key at the top of each game ranks its difficulty on a scale of 1 to 10, while indices in the back cross-reference the puzzles. (You’ll find the answers back there, too.)

    Admittedly, computers now play chess at the grandmaster level, but do they understand the game as we do? Can a computer eventually do everything a human mind can do? In this absorbing and frequently contentious book, Roger Penrose--eminent physicist and winner, with Stephen Hawking, of the prestigious Wolf prize--puts forward his view that there are some facets of human thinking that can never be emulated by a machine. Penrose examines what physics and mathematics can tell us about how the mind works, what they can't, and what we need to know to understand the physical processes of consciousness. He is among a growing number of physicists who think Einstein wasn't being stubborn when he said his little finger told him that quantum mechanics is incomplete, and he concludes that laws even deeper than quantum mechanics are essential for the operation of a mind. To support this contention, Penrose takes the reader on a dazzling tour that covers such topics as complex numbers, Turing machines, complexity theory, quantum mechanics, formal systems, Godel undecidability, phase spaces, Hilbert spaces, black holes, white holes, Hawking radiation, entropy, quasicrystals, the structure of the brain, and scores of other subjects. The Emperor's New Mind will appeal to anyone with a serious interest in modern physics and its relation to philosophical issues, as well as to physicists, mathematicians, philosophers and those on either side of the AI debate.

    This recreational math book takes the reader on a fantastic voyage into the world of natural numbers. From the earliest discoveries of the ancient Greeks to various fundamental characteristics of the natural number sequence, Clawson explains fascinating mathematical mysteries in clear and easy prose. He delves into the heart of number theory to see and understand the exquisite relationships among natural numbers, and ends by exploring the ultimate mystery of mathematics: the Riemann hypothesis, which says that through a point in a plane, no line can be drawn parallel to a given line.While a professional mathematician's treatment of number theory involves the most sophisticated analytical tools, its basic ideas are surprisingly easy to comprehend. By concentrating on the meaning behind various equations and proofs and avoiding technical refinements, Mathematical Mysteries lets the common reader catch a glimpse of this wonderful and exotic world.

    Topics include: Trigonometric Identities & Equations, Circular Functions, and Polar Equations & Complex Numbers.

    Petr Beckmann holds up this mirror, giving the background of the times when pi made progress -- and also when it did not, because science was being stifled by militarism or religious fanaticism.

    In this new, innovative overview textbook, the authors put special emphasis on the deep ideas of mathematics, and present the subject through lively and entertaining examples, anecdotes, challenges and illustrations, all of which are designed to excite the student's interest. The underlying ideas include topics from number theory, infinity, geometry, topology, probability and chaos theory. Throughout the text, the authors stress that mathematics is an analytical way of thinking, one that can be brought to bear on problem solving and effective thinking in any field of study.

    Two books bound as one.

    Though the answers may seem simple, their profound implications make the prisoner's dilemma one of the great unifying concepts of science. Watching players bluff in a poker game inspired John von Neumann--father of the modern computer and one of the sharpest minds of the century--to construct game theory, a mathematical study of conflict and deception. Game theory was readily embraced at the RAND Corporation, the archetypical think tank charged with formulating military strategy for the atomic age, and in 1950 two RAND scientists made a momentous discovery.Called the prisoner's dilemma, it is a disturbing and mind-bending game where two or more people may betray the common good for individual gain. Introduced shortly after the Soviet Union acquired the atomic bomb, the prisoner's dilemma quickly became a popular allegory of the nuclear arms race. Intellectuals such as von Neumann and Bertrand Russell joined military and political leaders in rallying to the preventive war movement, which advocated a nuclear first strike against the Soviet Union. Though the Truman administration rejected preventive war the United States entered into an arms race with the Soviets and game theory developed into a controversial tool of public policy--alternately accused of justifying arms races and touted as the only hope of preventing them.A masterful work of science writing, Prisoner's Dilemma weaves together a biography of the brilliant and tragic von Neumann, a history of pivotal phases of the cold war, and an investigation of game theory's far-reaching influence on public policy today. Most important, Prisoner's Dilemma is the incisive story of a revolutionary idea that has been hailed as a landmark of twentieth-century thought.

    More and more leading businesses today use estimation questions in interviews to test applicants' abilities to think on their feet. Guesstimation enables anyone with basic math and science skills to estimate virtually anything--quickly--using plausible assumptions and elementary arithmetic.Lawrence Weinstein and John Adam present an eclectic array of estimation problems that range from devilishly simple to quite sophisticated and from serious real-world concerns to downright silly ones. How long would it take a running faucet to fill the inverted dome of the Capitol? What is the total length of all the pickles consumed in the US in one year? What are the relative merits of internal-combustion and electric cars, of coal and nuclear energy? The problems are marvelously diverse, yet the skills to solve them are the same. The authors show how easy it is to derive useful ballpark estimates by breaking complex problems into simpler, more manageable ones--and how there can be many paths to the right answer. The book is written in a question-and-answer format with lots of hints along the way. It includes a handy appendix summarizing the few formulas and basic science concepts needed, and its small size and French-fold design make it conveniently portable. Illustrated with humorous pen-and-ink sketches, Guesstimation will delight popular-math enthusiasts and is ideal for the classroom.

    Each self-contained chapter consists of three sections. The first describes the statistic, including how it is used and what information it provides. The second section reviews how it works, how to calculate the formula, the strengths and weaknesses of the technique, and the conditions needed for its use. The final section provides examples that use and interpret the statistic. A glossary of terms and symbols is also included.New features in the second edition include:an interactive CD with PowerPoint presentations and problems for each chapter including an overview of the problem's solution; new chapters on basic research concepts including sampling, definitions of different types of variables, and basic research designs and one on nonparametric statistics; more graphs and more precise descriptions of each statistic; and a discussion of confidence intervals.This brief paperback is an ideal supplement for statistics, research methods, courses that use statistics, or as a reference tool to refresh one's memory about key concepts. The actual research examples are from psychology, education, and other social and behavioral sciences.Materials formerly available with this book on CD-ROM are now available for download from our website www.psypress.com. Go to the book's page and look for the 'Download' link in the right-hand column.

    "One of today's best popularizers of science." —Kirkus Reviews.Loyal readers of the monthly "Universe" essays in Natural History magazine have long recognized Neil deGrasse Tyson's talent for guiding them through the mysteries of the cosmos with stunning clarity and almost childlike enthusiasm. Here, Tyson compiles his favorite essays across a myriad of cosmic topics. The title essay introduces readers to the physics of black holes by explaining the gory details of what would happen to your body if you fell into one. "Holy Wars" examines the needless friction between science and religion in the context of historical conflicts. "The Search for Life in the Universe" explores astral life from the frontiers of astrobiology. And "Hollywood Nights" assails the movie industry's feeble efforts to get its night skies right. Known for his ability to blend content, accessibility, and humor, Tyson is a natural teacher who simplifies some of the most complex concepts in astrophysics while simultaneously sharing his infectious excitement about our universe.

    In this book, you’ll learn how many of the most fundamental data science tools and algorithms work by implementing them from scratch. If you have an aptitude for mathematics and some programming skills, author Joel Grus will help you get comfortable with the math and statistics at the core of data science, and with hacking skills you need to get started as a data scientist. Today’s messy glut of data holds answers to questions no one’s even thought to ask. This book provides you with the know-how to dig those answers out. Get a crash course in Python Learn the basics of linear algebra, statistics, and probability—and understand how and when they're used in data science Collect, explore, clean, munge, and manipulate data Dive into the fundamentals of machine learning Implement models such as k-nearest Neighbors, Naive Bayes, linear and logistic regression, decision trees, neural networks, and clustering Explore recommender systems, natural language processing, network analysis, MapReduce, and databases

    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.

    Persi Diaconis and Ron Graham provide easy, step-by-step instructions for each trick, explaining how to set up the effect and offering tips on what to say and do while performing it. Each card trick introduces a new mathematical idea, and varying the tricks in turn takes readers to the very threshold of today's mathematical knowledge.Diaconis and Graham tell the stories--and reveal the best tricks--of the eccentric and brilliant inventors of mathematical magic. The book exposes old gambling secrets through the mathematics of shuffling cards, explains the classic street-gambling scam of three-card Monte, traces the history of mathematical magic back to the oldest mathematical trick--and much more.

    There’s a famous piece of writing advice—offered by Ernest Hemingway, Stephen King, and myriad writers in between—not to use -ly adverbs like “quickly” or “fitfully.” It sounds like solid advice, but can we actually test it? If we were to count all the -ly adverbs these authors used in their careers, do they follow their own advice compared to other celebrated authors? What’s more, do great books in general—the classics and the bestsellers—share this trait?In Nabokov’s Favorite Word Is Mauve, statistician and journalist Ben Blatt brings big data to the literary canon, exploring the wealth of fun findings that remain hidden in the works of the world’s greatest writers. He assembles a database of thousands of books and hundreds of millions of words, and starts asking the questions that have intrigued curious word nerds and book lovers for generations: What are our favorite authors’ favorite words? Do men and women write differently? Are bestsellers getting dumber over time? Which bestselling writer uses the most clichés? What makes a great opening sentence? How can we judge a book by its cover? And which writerly advice is worth following or ignoring?