Today, unfortunately, the traditional place of mathematics in education is in grave danger. The teaching and learning of mathematics has degenerated into the realm of rote memorization, the outcome of which leads to satisfactory formal ability but does not lead to real understanding or to greater intellectual independence. This new edition of Richard Courant's and Herbert Robbins's classic work seeks to address this problem. Its goal is to put the meaning back into mathematics.Written for beginners and scholars, for students and teachers, for philosophers and engineers, What is Mathematics? Second Edition is a sparkling collection of mathematical gems that offers an entertaining and accessible portrait of the mathematical world. Covering everything from natural numbers and the number system to geometrical constructions and projective geometry, from topology and calculus to matters of principle and the Continuum Hypothesis, this fascinating survey allows readers to delve into mathematics as an organic whole rather than an empty drill in problem solving. With chapters largely independent of one another and sections that lead upward from basic to more advanced discussions, readers can easily pick and choose areas of particular interest without impairing their understanding of subsequent parts.Brought up to date with a new chapter by Ian Stewart, What is Mathematics? Second Edition offers new insights into recent mathematical developments and describes proofs of the Four-Color Theorem and Fermat's Last Theorem, problems that were still open when Courant and Robbins wrote this masterpiece, but ones that have since been solved.Formal mathematics is like spelling and grammar - a matter of the correct application of local rules. Meaningful mathematics is like journalism - it tells an interesting story. But unlike some journalism, the story has to be true. The best mathematics is like literature - it brings a story to life before your eyes and involves you in it, intellectually and emotionally. What is Mathematics is like a fine piece of literature - it opens a window onto the world of mathematics for anyone interested to view.

    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.

    And then we wonder why software is notorious for being delivered late and full of bugs, while other engineers routinely deliver finished bridges, automobiles, electrical appliances, etc., on time and with only minor defects. This book sets out to redress this imbalance. Members of my advanced development team at Adobe who took the course based on the same material all benefited greatly from the time invested. It may appear as a highly technical text intended only for computer scientists, but it should be required reading for all practicing software engineers." --Martin Newell, Adobe Fellow"The book contains some of the most beautiful code I have ever seen." --Bjarne Stroustrup, Designer of C++"I am happy to see the content of Alex's course, the development and teaching of which I strongly supported as the CTO of Silicon Graphics, now available to all programmers in this elegant little book." --Forest Baskett, General Partner, New Enterprise Associates"Paul's patience and architectural experience helped to organize Alex's mathematical approach into a tightly-structured edifice--an impressive feat!" --Robert W. Taylor, Founder of Xerox PARC CSL and DEC Systems Research Center Elements of Programming provides a different understanding of programming than is presented elsewhere. Its major premise is that practical programming, like other areas of science and engineering, must be based on a solid mathematical foundation. The book shows that algorithms implemented in a real programming language, such as C++, can operate in the most general mathematical setting. For example, the fast exponentiation algorithm is defined to work with any associative operation. Using abstract algorithms leads to efficient, reliable, secure, and economical software.This is not an easy book. Nor is it a compilation of tips and tricks for incremental improvements in your programming skills. The book's value is more fundamental and, ultimately, more critical for insight into programming. To benefit fully, you will need to work through it from beginning to end, reading the code, proving the lemmas, and doing the exercises. When finished, you will see how the application of the deductive method to your programs assures that your system's software components will work together and behave as they must.The book presents a number of algorithms and requirements for types on which they are defined. The code for these descriptions--also available on the Web--is written in a small subset of C++ meant to be accessible to any experienced programmer. This subset is defined in a special language appendix coauthored by Sean Parent and Bjarne Stroustrup.Whether you are a software developer, or any other professional for whom programming is an important activity, or a committed student, you will come to understand what the book's experienced authors have been teaching and demonstrating for years--that mathematics is good for programming, and that theory is good for practice.

    In Burn Math Class, Jason Wilkes takes the traditional approach to how we learn math -- with its unwelcoming textbooks, unexplained rules, and authoritarian assertions-and sets it on fire. Focusing on how mathematics is created rather than on mathematical facts, Wilkes teaches the subject in a way that requires no memorization and no prior knowledge beyond addition and multiplication. From these simple foundations, Burn Math Class shows how mathematics can be (re)invented from scratch without preexisting textbooks and courses. We can discover math on our own through experimentation and failure, without appealing to any outside authority. When math is created free from arcane notations and pretentious jargon that hide the simplicity of mathematical concepts, it can be understood organically -- and it becomes fun! Following this unconventional approach, Burn Math Class leads the reader from the basics of elementary arithmetic to various "advanced" topics, such as time-dilation in special relativity, Taylor series, and calculus in infinite-dimensional spaces. Along the way, Wilkes argues that orthodox mathematics education has been teaching the subject backward: calculus belongs before many of its so-called prerequisites, and those prerequisites cannot be fully understood without calculus. Like the smartest, craziest teacher you've ever had, Wilkes guides you on an adventure in mathematical creation that will radically change the way you think about math. Revealing the beauty and simplicity of this timeless subject, Burn Math Class turns everything that seems difficult about mathematics upside down and sideways until you understand just how easy math can be.

    Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield. Although the lectures are now thirteen years old, most of the material is timeless and presents a “Feynmanesque” overview of many standard and some not-so-standard topics in computer science such as reversible logic gates and quantum computers.

    In this lively book of essays, Stephen Wolfram takes the reader along on some of his most surprising and engaging intellectual adventures in science, technology, artificial intelligence and language design.

    Dozens of examples in innumeracy show us how it affects not only personal economics and travel plans, but explains mis-chosen mates, inappropriate drug-testing, and the allure of pseudo-science.

    By presenting actual experiences and analyzing them as they are described, the author conveys the developmental thought processes employed and shows a style of thinking that leads to successful results is something that can be learned. Along with spectacular successes, the author also conveys how failures contributed to shaping the thought processes. Provides the reader with a style of thinking that will enhance a person's ability to function as a problem-solver of complex technical issues. Consists of a collection of stories about the author's participation in significant discoveries, relating how those discoveries came about and, most importantly, provides analysis about the thought processes and reasoning that took place as the author and his associates progressed through engineering problems.

    These are not just great thinkers they also make great comics. Action Philosophers details the lives and thoughts of history's A-list brain trust in hip and humorous comic book fashion. All nine issues of the award-winning, best-selling comic book series have been collected into a single volume, making this a comprehensive cartoon history of ideas from pre-Socratics to Jacques Derrida, including four new stories. ""You'll never have more fun getting the real scoop on the big ideas that have made the world the mess we live in today!"" — Tom Morris (Author of Philosophy for Dummies, If Aristotle Ran General Motors, and If Harry Potter Ran General Electric).

    Now, in this new cookbook featuring 85 delicious dishes that have been lightened up for guilt-free everyday eating, Eisner shows how the Instant Pot can be a part of your plan to slim down and keep the weight off--without losing any of the flavor.Building on the wild success of Eisner's popular Pressure Luck Cooking website and YouTube channel, every recipe in this book is illustrated with clear photographs showing exactly what to do in each step. There are no hard-to-find ingredients or fussy techniques, and each dish takes advantage of the time-saving benefits of the Instant Pot.

    Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.

    It describes how the laws and discoveries of information theory now support controversial revisions to Darwinian evolution, begin to unravel the mysteries of language, memory and dreams, and stimulate provocative ideas in psychology, philosophy, art, music, computers and even the structure of society. Perhaps its most fascinating and unexpected surprise is the suggestion the order and complexity may be as natural as disorder and disorganization. Contrary to the entropy principle, which implies that order is the exception and confusion the rule, information theory asserts that order and sense can indeed prevail against disorder and nonsense. From the simplest forms of organic life to the words used to express our most complex ideas, from our genes to our dreams, from microcomputers to telecommunications, virtually everything around us follows simple rules of information. Life and the material world, like language, remain "grammatical." Grammatical man inhabits a grammatical universe.

    Poker, Scrabble, and bridge. These seven games, ancient and modern, fascinate millions of people worldwide. In Seven Games, Oliver Roeder charts their origins and historical importance, the delightful arcana of their rules, and the ways their design makes them pleasurable.Roeder introduces thrilling competitors, such as evangelical minister Marion Tinsley, who across forty years lost only three games of checkers; Shusai, the Master, the last Go champion of imperial Japan, defending tradition against “modern rationalism”; and an IBM engineer who created a backgammon program so capable at self-learning that NASA used it on the space shuttle. He delves into the history and lore of each game: backgammon boards in ancient Egypt, the Indian origins of chess, how certain shells from a particular beach in Japan make the finest white Go stones.Beyond the cultural and personal stories, Roeder explores why games, seemingly trivial pastimes, speak so deeply to the human soul. He introduces an early philosopher of games, the aptly named Bernard Suits, and visits an Oxford cosmologist who has perfected a computer that can effectively play bridge, a game as complicated as human language itself.Throughout, Roeder tells the compelling story of how humans, pursuing scientific glory and competitive advantage, have invented AI programs better than any human player, and what that means for the games—and for us. Funny, fascinating, and profound, Seven Games is a story of obsession, psychology, history, and how play makes us human.

    More than any other language, Python was created with the philosophy of simplicity and parsimony. Now 25 years old, Python has become the primary or secondary language (after SQL) for many business users. With popularity comes diversity--and possibly dilution.This guide, collaboratively written by over a hundred members of the Python community, describes best practices currently used by package and application developers. Unlike other books for this audience, The Hitchhiker's Guide is light on reusable code and heavier on design philosophy, directing the reader to excellent sources that already exist.

    Distinguishing agents (e.g., molecules, cells, animals, and species) from their interactions (e.g., chemical reactions, immune system responses, sexual reproduction, and evolution), Flake argues that it is the computational properties of interactions that account for much of what we think of as beautiful and interesting. From this basic thesis, Flake explores what he considers to be today's four most interesting computational topics: fractals, chaos, complex systems, and adaptation.Each of the book's parts can be read independently, enabling even the casual reader to understand and work with the basic equations and programs. Yet the parts are bound together by the theme of the computer as a laboratory and a metaphor for understanding the universe. The inspired reader will experiment further with the ideas presented to create fractal landscapes, chaotic systems, artificial life forms, genetic algorithms, and artificial neural networks.