The book has been designed to offer maximal accessibility to the widest range of students (not only those majoring in philosophy) and assumes no formal training in elementary symbolic logic. It offers a comprehensive course covering all basic definitions of induction and probability, and considers such topics as decision theory, Bayesianism, frequency ideas, and the philosophical problem of induction. The key features of the book are: * A lively and vigorous prose style* Lucid and systematic organization and presentation of the ideas* Many practical applications* A rich supply of exercises drawing on examples from such fields as psychology, ecology, economics, bioethics, engineering, and political science* Numerous brief historical accounts of how fundamental ideas of probability and induction developed.* A full bibliography of further reading Although designed primarily for courses in philosophy, the book could certainly be read and enjoyed by those in the social sciences (particularly psychology, economics, political science and sociology) or medical sciences such as epidemiology seeking a reader-friendly account of the basic ideas of probability and induction. Ian Hacking is University Professor, University of Toronto. He is Fellow of the Royal Society of Canada, Fellow of the British Academy, and Fellow of the American Academy of Arts and Sciences. he is author of many books including five previous books with Cambridge (The Logic of Statistical Inference, Why Does Language Matter to Philosophy?, The Emergence of Probability, Representing and Intervening, and The Taming of Chance).

    As the words "at work" suggest, Peter Seibel focuses on how his interviewees tackle the day–to–day work of programming, while revealing much more, like how they became great programmers, how they recognize programming talent in others, and what kinds of problems they find most interesting. Hundreds of people have suggested names of programmers to interview on the Coders at Work web site: http://www.codersatwork.com. The complete list was 284 names. Having digested everyone’s feedback, we selected 16 folks who’ve been kind enough to agree to be interviewed:- Frances Allen: Pioneer in optimizing compilers, first woman to win the Turing Award (2006) and first female IBM fellow- Joe Armstrong: Inventor of Erlang- Joshua Bloch: Author of the Java collections framework, now at Google- Bernie Cosell: One of the main software guys behind the original ARPANET IMPs and a master debugger- Douglas Crockford: JSON founder, JavaScript architect at Yahoo!- L. Peter Deutsch: Author of Ghostscript, implementer of Smalltalk-80 at Xerox PARC and Lisp 1.5 on PDP-1- Brendan Eich: Inventor of JavaScript, CTO of the Mozilla Corporation - Brad Fitzpatrick: Writer of LiveJournal, OpenID, memcached, and Perlbal - Dan Ingalls: Smalltalk implementor and designer- Simon Peyton Jones: Coinventor of Haskell and lead designer of Glasgow Haskell Compiler- Donald Knuth: Author of The Art of Computer Programming and creator of TeX- Peter Norvig: Director of Research at Google and author of the standard text on AI- Guy Steele: Coinventor of Scheme and part of the Common Lisp Gang of Five, currently working on Fortress- Ken Thompson: Inventor of UNIX- Jamie Zawinski: Author of XEmacs and early Netscape/Mozilla hackerWhat you’ll learn:How the best programmers in the world do their jobWho is this book for?Programmers interested in the point of view of leaders in the field. Programmers looking for approaches that work for some of these outstanding programmers.

    . . full of intellectual treats and tricks, of whimsy and deep scientific philosophy. It is highbrow entertainment at its best, a teasing challenge to all who aspire to think about the universe." — New York Herald TribuneOne of the world's foremost nuclear physicists (celebrated for his theory of radioactive decay, among other accomplishments), George Gamow possessed the unique ability of making the world of science accessible to the general reader.He brings that ability to bear in this delightful expedition through the problems, pleasures, and puzzles of modern science. Among the topics scrutinized with the author's celebrated good humor and pedagogical prowess are the macrocosm and the microcosm, theory of numbers, relativity of space and time, entropy, genes, atomic structure, nuclear fission, and the origin of the solar system.In the pages of this book readers grapple with such crucial matters as whether it is possible to bend space, why a rocket shrinks, the "end of the world problem," excursions into the fourth dimension, and a host of other tantalizing topics for the scientifically curious. Brimming with amusing anecdotes and provocative problems, One Two Three . . . Infinity also includes over 120 delightful pen-and-ink illustrations by the author, adding another dimension of good-natured charm to these wide-ranging explorations.Whatever your level of scientific expertise, chances are you'll derive a great deal of pleasure, stimulation, and information from this unusual and imaginative book. It belongs in the library of anyone curious about the wonders of the scientific universe. "In One Two Three . . . Infinity, as in his other books, George Gamow succeeds where others fail because of his remarkable ability to combine technical accuracy, choice of material, dignity of expression, and readability." — Saturday Review of Literature

    It details programming with SRGP, a simple but powerful raster graphics package. Important algorithms in 2D and 3D graphics are detailed for easy implementation, and a thorough presentation of the mathematical principles of geometric transformations and viewing are included.

    Louis are all intimately connected with the mysterious number e. In this informal and engaging history, Eli Maor portrays the curious characters and the elegant mathematics that lie behind the number. Designed for a reader with only a modest mathematical background, this biography brings out the central importance of e to mathematics and illuminates a golden era in the age of science.

    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

    The heart of this creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design.

    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.

    This book draws on material Michael created for his renowned Object Mentor seminars, techniques Michael has used in mentoring to help hundreds of developers, technical managers, and testers bring their legacy systems under control. The topics covered include: Understanding the mechanics of software change, adding features, fixing bugs, improving design, optimizing performance Getting legacy code into a test harness Writing tests that protect you against introducing new problems Techniques that can be used with any language or platform, with examples in Java, C++, C, and C# Accurately identifying where code changes need to be made Coping with legacy systems that aren't object-oriented Handling applications that don't seem to have any structureThis book also includes a catalog of twenty-four dependency-breaking techniques that help you work with program elements in isolation and make safer changes.

    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.

    If you're a reasonably proficient programmer who can think logically, you have all the background you'll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem. As you read this book, you'll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You'll also gain deep insight into the value of mathematics to programming--insight that will prove invaluable no matter what programming languages and paradigms you use. You will learn aboutHow to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiencyAncient paradoxes, beautiful theorems, and the productive tension between continuous and discreteA simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on itPowerful mathematical approaches to abstractionHow abstract algebra provides the idea at the heart of generic programmingAxioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structuresSurprising subtleties of simple programming tasks and what you can learn from themHow practical implementations can exploit theoretical knowledge

    The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

    In Irreligion he presents the case for his own worldview, organizing his book into twelve chapters that refute the twelve arguments most often put forward for believing in God's existence. The latter arguments, Paulos relates in his characteristically lighthearted style, "range from what might be called golden oldies to those with a more contemporary beat. On the playlist are the firstcause argument, the argument from design, the ontological argument, arguments from faith and biblical codes, the argument from the anthropic principle, the moral universality argument, and others." Interspersed among his twelve counterarguments are remarks on a variety of irreligious themes, ranging from the nature of miracles and creationist probability to cognitive illusions and prudential wagers. Special attention is paid to topics, arguments, and questions that spring from his incredulity "not only about religion but also about others' credulity." Despite the strong influence of his day job, Paulos says, there isn't a single mathematical formula in the book.

    The term “complexity” can be misleading, however, because what makes West’s discoveries so beautiful is that he has found an underlying simplicity that unites the seemingly complex and diverse phenomena of living systems, including our bodies, our cities and our businesses. Fascinated by issues of aging and mortality, West applied the rigor of a physicist to the biological question of why we live as long as we do and no longer. The result was astonishing, and changed science, creating a new understanding of energy use and metabolism: West found that despite the riotous diversity in the sizes of mammals, they are all, to a large degree, scaled versions of each other. If you know the size of a mammal, you can use scaling laws to learn everything from how much food it eats per day, what its heart-rate is, how long it will take to mature, its lifespan, and so on. Furthermore, the efficiency of the mammal’s circulatory systems scales up precisely based on weight: if you compare a mouse, a human and an elephant on a logarithmic graph, you find with every doubling of average weight, a species gets 25% more efficient—and lives 25% longer. This speaks to everything from how long we can expect to live to how many hours of sleep we need. Fundamentally, he has proven, the issue has to do with the fractal geometry of the networks that supply energy and remove waste from the organism's body. West's work has been game-changing for biologists, but then he made the even bolder move of exploring his work's applicability to cities. Cities, too, are constellations of networks and laws of scalability relate with eerie precision to them. For every doubling in a city's size, the city needs 15% less road, electrical wire, and gas stations to support the same population. More amazingly, for every doubling in size, cities produce 15% more patents and more wealth, as well as 15% more crime and disease. This broad pattern lays the groundwork for a new science of cities. Recently, West has applied his revolutionary work on cities and biological life to the business world. This investigation has led to powerful insights into why some companies thrive while others fail. The implications of these discoveries are far-reaching, and are just beginning to be explored. Scale is a thrilling scientific adventure story about the elemental natural laws that bind us together in simple but profound ways. Through the brilliant mind of Geoffrey West, we can envision how cities, companies and biological life alike are dancing to the same simple, powerful tune, however diverse and unrelated they are to each other.From the Hardcover edition.

    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.