How to Bake Pi: An Edible Exploration of the Mathematics of Mathematics


Eugenia Cheng - 2015
    Of course, it’s not all cooking; we’ll also run the New York and Chicago marathons, pay visits to Cinderella and Lewis Carroll, and even get to the bottom of a tomato’s identity as a vegetable. This is not the math of our high school classes: mathematics, Cheng shows us, is less about numbers and formulas and more about how we know, believe, and understand anything, including whether our brother took too much cake.At the heart of How to Bake Pi is Cheng’s work on category theory—a cutting-edge “mathematics of mathematics.” Cheng combines her theory work with her enthusiasm for cooking both to shed new light on the fundamentals of mathematics and to give readers a tour of a vast territory no popular book on math has explored before. Lively, funny, and clear, How to Bake Pi will dazzle the initiated while amusing and enlightening even the most hardened math-phobe.

Introduction to Topology


Bert Mendelson - 1975
    It provides a simple, thorough survey of elementary topics, starting with set theory and advancing to metric and topological spaces, connectedness, and compactness. 1975 edition.

Reinforcement Learning: An Introduction


Richard S. Sutton - 1998
    Their discussion ranges from the history of the field's intellectual foundations to the most recent developments and applications.Reinforcement learning, one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives when interacting with a complex, uncertain environment. In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the key ideas and algorithms of reinforcement learning. Their discussion ranges from the history of the field's intellectual foundations to the most recent developments and applications. The only necessary mathematical background is familiarity with elementary concepts of probability.The book is divided into three parts. Part I defines the reinforcement learning problem in terms of Markov decision processes. Part II provides basic solution methods: dynamic programming, Monte Carlo methods, and temporal-difference learning. Part III presents a unified view of the solution methods and incorporates artificial neural networks, eligibility traces, and planning; the two final chapters present case studies and consider the future of reinforcement learning.

Contemporary Abstract Algebra


Joseph A. Gallian - 2004
    His Contemporary Abstract Algebra, 6/e, includes challenging topics in abstract algebra as well as numerous figures, tables, photographs, charts, biographies, computer exercises, and suggested readings that give the subject a current feel and makes the content interesting and relevant for students.

The Art of Statistics: How to Learn from Data


David Spiegelhalter - 2019
      Statistics are everywhere, as integral to science as they are to business, and in the popular media hundreds of times a day. In this age of big data, a basic grasp of statistical literacy is more important than ever if we want to separate the fact from the fiction, the ostentatious embellishments from the raw evidence -- and even more so if we hope to participate in the future, rather than being simple bystanders. In The Art of Statistics, world-renowned statistician David Spiegelhalter shows readers how to derive knowledge from raw data by focusing on the concepts and connections behind the math. Drawing on real world examples to introduce complex issues, he shows us how statistics can help us determine the luckiest passenger on the Titanic, whether a notorious serial killer could have been caught earlier, and if screening for ovarian cancer is beneficial. The Art of Statistics not only shows us how mathematicians have used statistical science to solve these problems -- it teaches us how we too can think like statisticians. We learn how to clarify our questions, assumptions, and expectations when approaching a problem, and -- perhaps even more importantly -- we learn how to responsibly interpret the answers we receive. Combining the incomparable insight of an expert with the playful enthusiasm of an aficionado, The Art of Statistics is the definitive guide to stats that every modern person needs.

Numerical Recipes in C: The Art of Scientific Computing


William H. Press - 1988
    In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today.

Good Math: A Geek's Guide to the Beauty of Numbers, Logic, and Computation


Mark C. Chu-Carroll - 2013
    There is joy and beauty in mathematics, and in more than two dozen essays drawn from his popular “Good Math” blog, you’ll find concepts, proofs, and examples that are often surprising, counterintuitive, or just plain weird.Mark begins his journey with the basics of numbers, with an entertaining trip through the integers and the natural, rational, irrational, and transcendental numbers. The voyage continues with a look at some of the oddest numbers in mathematics, including zero, the golden ratio, imaginary numbers, Roman numerals, and Egyptian and continuing fractions. After a deep dive into modern logic, including an introduction to linear logic and the logic-savvy Prolog language, the trip concludes with a tour of modern set theory and the advances and paradoxes of modern mechanical computing.If your high school or college math courses left you grasping for the inner meaning behind the numbers, Mark’s book will both entertain and enlighten you.

The Calculus Lifesaver: All the Tools You Need to Excel at Calculus


Adrian Banner - 2007
    The Calculus Lifesaver provides students with the essential tools they need not only to learn calculus, but to excel at it.All of the material in this user-friendly study guide has been proven to get results. The book arose from Adrian Banner's popular calculus review course at Princeton University, which he developed especially for students who are motivated to earn A's but get only average grades on exams. The complete course will be available for free on the Web in a series of videotaped lectures. This study guide works as a supplement to any single-variable calculus course or textbook. Coupled with a selection of exercises, the book can also be used as a textbook in its own right. The style is informal, non-intimidating, and even entertaining, without sacrificing comprehensiveness. The author elaborates standard course material with scores of detailed examples that treat the reader to an inner monologue--the train of thought students should be following in order to solve the problem--providing the necessary reasoning as well as the solution. The book's emphasis is on building problem-solving skills. Examples range from easy to difficult and illustrate the in-depth presentation of theory.The Calculus Lifesaver combines ease of use and readability with the depth of content and mathematical rigor of the best calculus textbooks. It is an indispensable volume for any student seeking to master calculus.Serves as a companion to any single-variable calculus textbookInformal, entertaining, and not intimidatingInformative videos that follow the book--a full forty-eight hours of Banner's Princeton calculus-review course--is available at Adrian Banner lecturesMore than 475 examples (ranging from easy to hard) provide step-by-step reasoningTheorems and methods justified and connections made to actual practiceDifficult topics such as improper integrals and infinite series covered in detailTried and tested by students taking freshman calculus

Mathematical Mysteries: The Beauty and Magic of Numbers


Calvin C. Clawson - 1996
    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.

Discrete-Event System Simulation


Jerry Banks - 1983
    This text provides a basic treatment of discrete-event simulation, including the proper collection and analysis of data, the use of analytic techniques, verification and validation of models, and designing simulation experiments. It offers an up-to-date treatment of simulation of manufacturing and material handling systems, computer systems, and computer networks. Students and instructors will find a variety of resources at the associated website, www.bcnn.net, including simulation source code for download, additional exercises and solutions, web links and errata.

Asimov on Numbers


Isaac Asimov - 1978
    From man's first act of counting to higher mathematics, from the smallest living creature to the dazzling reaches of outer space, Asimov is a master at "explaining complex material better than any other living person." (The New York Times) You'll learn: HOW to make a trillion seem small; WHY imaginary numbers are real; THE real size of the universe - in photons; WHY the zero isn't "good for nothing;" AND many other marvelous discoveries, in ASIMOV ON NUMBERS.

A History of π


Petr Beckmann - 1970
    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.

Lauren Ipsum


Carlos Bueno - 2011
    If the idea of a computer science book without computers upsets you, please close your eyes until you’ve finished reading the rest of this page.The truth is that computer science is not really about the computer. It is just a tool to help you see ideas more clearly. You can see the moon and stars without a telescope, smell the flowers without a fluoroscope, have fun without a funoscope, and be silly sans oscilloscope.You can also play with computer science without... you-know-what. Ideas are the real stuff of computer science. This book is about those ideas, and how to find them.

Algorithms


Sanjoy Dasgupta - 2006
    Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read. Tim Roughgarden Stanford University

An Introduction to Formal Language and Automata


Peter Linz - 1990
    The Text Was Designed To Familiarize Students With The Foundations And Principles Of Computer Science And To Strengthen The Students' Ability To Carry Out Formal And Rigorous Mathematical Arguments. In The New Fourth Edition, Author Peter Linz Has Offered A Straightforward, Uncomplicated Treatment Of Formal Languages And Automata And Avoids Excessive Mathematical Detail So That Students May Focus On And Understand The Underlying Principles. In An Effort To Further The Accessibility And Comprehension Of The Text, The Author Has Added New Illustrative Examples Throughout.