We have Mindstorms to thank for that. In this book, pioneering computer scientist Seymour Papert uses the invention of LOGO, the first child-friendly programming language, to make the case for the value of teaching children with computers. Papert argues that children are more than capable of mastering computers, and that teaching computational processes like de-bugging in the classroom can change the way we learn everything else. He also shows that schools saturated with technology can actually improve socialization and interaction among students and between students and teachers.

     Now Roy Sorensen offers the first narrative history of paradoxes, a fascinating and eye-opening account that extends from the ancient Greeks, through the Middle Ages, the Enlightenment, and into the twentieth century. When Augustine asked what God was doing before He made the world, he wastold: Preparing hell for people who ask questions like that. A Brief History of the Paradox takes a close look at questions like that and the philosophers who have asked them, beginning with the folk riddles that inspired Anaximander to erect the first metaphysical system and ending with suchthinkers as Lewis Carroll, Ludwig Wittgenstein, and W.V. Quine. Organized chronologically, the book is divided into twenty-four chapters, each of which pairs a philosopher with a major paradox, allowing for extended consideration and putting a human face on the strategies that have been taken towardthese puzzles. Readers get to follow the minds of Zeno, Socrates, Aquinas, Ockham, Pascal, Kant, Hegel, and many other major philosophers deep inside the tangles of paradox, looking for, and sometimes finding, a way out. Filled with illuminating anecdotes and vividly written, A Brief History of the Paradox will appeal to anyone who finds trying to answer unanswerable questions a paradoxically pleasant endeavor.

    The most fundamental differences are philosophical, and readers of this book will emerge with a clearer understandingof paradoxical-sounding concepts such as infinity, curved space, and imaginary numbers. The first few chapters are about general aspects of mathematical thought. These are followed by discussions of more specific topics, and the book closes with a chapter answering common sociological questionsabout the mathematical community (such as Is it true that mathematicians burn out at the age of 25?) It is the ideal introduction for anyone who wishes to deepen their understanding of mathematics.About the Series: Combining authority with wit, accessibility, and style, Very Short Introductions offer an introduction to some of life's most interesting topics. Written by experts for the newcomer, they demonstrate the finest contemporary thinking about the central problems and issues in hundredsof key topics, from philosophy to Freud, quantum theory to Islam.

    This text has invited more than 4 million students into the study of this dynamic and essential discipline.The authors have restructured each chapter around a conceptual framework of five or six big ideas. An Overview draws students in and sets the stage for the rest of the chapter, each numbered Concept Head announces the beginning of a new concept, and Concept Check questions at the end of each chapter encourage students to assess their mastery of a given concept. New Inquiry Figures focus students on the experimental process, and new Research Method Figures illustrate important techniques in biology. Each chapter ends with a Scientific Inquiry Question that asks students to apply scientific investigation skills to the content of the chapter.

    Early beginnings in antiquity, medieval contributions, and a century of anticipation lead up to a consideration of Newton and Leibniz, the period of indecison that followed them, and the final rigorous formulation that we know today.

    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 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.

    Its world-class authors provide guidance on all aspects of Bayesian data analysis and include examples of real statistical analyses, based on their own research, that demonstrate how to solve complicated problems. Changes in the new edition include:Stronger focus on MCMC Revision of the computational advice in Part III New chapters on nonlinear models and decision analysis Several additional applied examples from the authors' recent research Additional chapters on current models for Bayesian data analysis such as nonlinear models, generalized linear mixed models, and more Reorganization of chapters 6 and 7 on model checking and data collectionBayesian computation is currently at a stage where there are many reasonable ways to compute any given posterior distribution. However, the best approach is not always clear ahead of time. Reflecting this, the new edition offers a more pluralistic presentation, giving advice on performing computations from many perspectives while making clear the importance of being aware that there are different ways to implement any given iterative simulation computation. The new approach, additional examples, and updated information make Bayesian Data Analysis an excellent introductory text and a reference that working scientists will use throughout their professional life.

    Groundbreaking in every way when first published, this book is a simple, straightforward, direct calculus text. It's popularity is directly due to its broad use of applications, the easy-to-understand writing style, and the wealth of examples and exercises which reinforce conceptualization of the subject matter. The author wrote this text with three objectives in mind. The first was to make the book more student-oriented by expanding discussions and providing more examples and figures to help clarify concepts. To further aid students, guidelines for solving problems were added in many sections of the text. The second objective was to stress the usefulness of calculus by means of modern applications of derivatives and integrals. The third objective, to make the text as accurate and error-free as possible, was accomplished by a careful examination of the exposition, combined with a thorough checking of each example and exercise.

    It aims to demonstrate that serious philosophical inquiry may be perplexing, but is ultimately enlightening and liberating.

    Theory and practice in the design of data graphics, 250 illustrations of the best (and a few of the worst) statistical graphics, with detailed analysis of how to display data for precise, effective, quick analysis. Design of the high-resolution displays, small multiples. Editing and improving graphics. The data-ink ratio. Time-series, relational graphics, data maps, multivariate designs. Detection of graphical deception: design variation vs. data variation. Sources of deception. Aesthetics and data graphical displays. This is the second edition of The Visual Display of Quantitative Information. Recently published, this new edition provides excellent color reproductions of the many graphics of William Playfair, adds color to other images, and includes all the changes and corrections accumulated during 17 printings of the first edition.

    Now, in The Unimaginable Mathematics of Borges' Library of Babel, William Goldbloom Bloch takes readers on a fascinating tour of the mathematical ideas hiddenwithin one of the classic works of modern literature.Written in the vein of Douglas R. Hofstadter's Pulitzer Prize-winning G�del, Escher, Bach, this original and imaginative book sheds light on one of Borges' most complex, richly layered works. Bloch begins each chapter with a mathematical idea--combinatorics, topology, geometry, informationtheory--followed by examples and illustrations that put flesh on the theoretical bones. In this way, he provides many fascinating insights into Borges' Library. He explains, for instance, a straightforward way to calculate how many books are in the Library--an easily notated but literallyunimaginable number--and also shows that, if each book were the size of a grain of sand, the entire universe could only hold a fraction of the books in the Library. Indeed, if each book were the size of a proton, our universe would still not be big enough to hold anywhere near all the books.Given Borges' well-known affection for mathematics, this exploration of the story through the eyes of a humanistic mathematician makes a unique and important contribution to the body of Borgesian criticism. Bloch not only illuminates one of the great short stories of modern literature but alsoexposes the reader--including those more inclined to the literary world--to many intriguing and entrancing mathematical ideas.

    From this starting point, and assuming no previous knowledge of logic, Wilfrid Hodges takes the reader through the whole gamut of logical expressions in a simple and lively way. Readers who are more mathematically adventurous will find optional sections introducing rather more challenging material. 'A lively and stimulating book' Philosophy

    Myerson introduces, clarifies, and synthesizes the extraordinary advances made in the subject over the past fifteen years, presents an overview of decision theory, and comprehensively reviews the development of the fundamental models: games in extensive form and strategic form, and Bayesian games with incomplete information.Game Theory will be useful for students at the graduate level in economics, political science, operations research, and applied mathematics. Everyone who uses game theory in research will find this book essential.

    … The book the National Security Agency wanted never to be published." –Wired Magazine "…monumental… fascinating… comprehensive… the definitive work on cryptography for computer programmers…" –Dr. Dobb's Journal"…easily ranks as one of the most authoritative in its field." —PC Magazine"…the bible of code hackers." –The Millennium Whole Earth CatalogThis new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography—the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. What's new in the Second Edition? * New information on the Clipper Chip, including ways to defeat the key escrow mechanism * New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher * The latest protocols for digital signatures, authentication, secure elections, digital cash, and more * More detailed information on key management and cryptographic implementations