W. R. Dedekind. The first presents Dedekind's theory of the irrational number-the Dedekind cut idea-perhaps the most famous of several such theories created in the 19th century to give a precise meaning to irrational numbers, which had been used on an intuitive basis since Greek times. This paper provided a purely arithmetic and perfectly rigorous foundation for the irrational numbers and thereby a rigorous meaning of continuity in analysis.The second essay is an attempt to give a logical basis for transfinite numbers and properties of the natural numbers. It examines the notion of natural numbers, the distinction between finite and transfinite (infinite) whole numbers, and the logical validity of the type of proof called mathematical or complete induction.The contents of these essays belong to the foundations of mathematics and will be welcomed by those who are prepared to look into the somewhat subtle meanings of the elements of our number system. As a major work of an important mathematician, the book deserves a place in the personal library of every practicing mathematician and every teacher and historian of mathematics. Authorized translations by "Vooster " V. Beman.

    A basic idea that proved elusive for hundreds of years and bent the minds of the greatest thinkers in the world, the algorithm is what made the modern world possible. Without the algorithm, there would have been no computer, no Internet, no virtual reality, no e-mail, or any other technological advance that we rely on every day.In The Advent of the Algorithm, David Berlinski combines science, history, and math to explain and explore the intriguing story of how the algorithm was finally discovered by a succession of mathematicians and logicians, and how this paved the way for the digital age. Beginning with Leibniz and culminating in the middle of the twentieth century with the groundbreaking work of Gödel and Turing, The Advent of the Algorithm is an epic tale told with clarity and imaginative brilliance.

    What should we do, or leave undone, in a day or a lifetime? How much messiness should we accept? What balance of new activities and familiar favorites is the most fulfilling? These may seem like uniquely human quandaries, but they are not: computers, too, face the same constraints, so computer scientists have been grappling with their version of such issues for decades. And the solutions they've found have much to teach us.In a dazzlingly interdisciplinary work, acclaimed author Brian Christian and cognitive scientist Tom Griffiths show how the algorithms used by computers can also untangle very human questions. They explain how to have better hunches and when to leave things to chance, how to deal with overwhelming choices and how best to connect with others. From finding a spouse to finding a parking spot, from organizing one's inbox to understanding the workings of memory, Algorithms to Live By transforms the wisdom of computer science into strategies for human living.

    Subsequent sections deal with integrating factors; dilution and accretion problems; linearization of first order systems; Laplace Transforms; Newton's Interpolation Formulas, more.

    From the early Greek influences to the Middle Ages and the Renaissance to the end of the 19th century, trace the fascinating foundation of mathematics as it developed through the ages. Aristotle, Galileo, Kepler, Newton: you know the names. Now here's what they really did, and the effect their discoveries had on our culture, all explained in a way the layperson can understand. Begin with the basis of arithmetic (Plato and the introduction of geometry), and discover why the use of Arabic numerals was critical to the development of both commerce and science. The development of calculus made space travel a reality, while the abacus prefigured the computer. The greats examined in depth include Leonardo da Vinci, a brilliant mathematician as well as artist; Pascal, who laid out the theory of probabilities; and Fermat, whose intriguing theory has only recently been solved.

    Suitable for a two semester course in complex analysis, or as a supplementary text for an advanced course in function theory, this book aims to give students a good foundation of complex analysis and provides a basis for solving problems in mathematics, physics, engineering and many other sciences.

    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.

    The discussion of problem solving strategies is extensive. It is written for trainers and participants of contests of all levels up to the highest level: IMO, Tournament of the Towns, and the noncalculus parts of the Putnam Competition. It will appeal to high school teachers conducting a mathematics club who need a range of simple to complex problems and to those instructors wishing to pose a "problem of the week", "problem of the month", and "research problem of the year" to their students, thus bringing a creative atmosphere into their classrooms with continuous discussions of mathematical problems. This volume is a must-have for instructors wishing to enrich their teaching with some interesting non-routine problems and for individuals who are just interested in solving difficult and challenging problems. Each chapter starts with typical examples illustrating the central concepts and is followed by a number of carefully selected problems and their solutions. Most of the solutions are complete, but some merely point to the road leading to the final solution. Very few problems have no solutions. Readers interested in increasing the effectiveness of the book can do so by working on the examples in addition to the problems thereby increasing the number of problems to over 1300. In addition to being a valuable resource of mathematical problems and solution strategies, this volume is the most complete training book on the market.

    Intuition and computational abilities are stressed. Original material on DE and multiple integrals has been expanded.

    Aiming to tell the dark secrets of computer arithmetic, this title is suitable for library developers, compiler writers, and lovers of elegant hacks.

    As well as lucid descriptions of all the topics and many worked examples, it contains over 800 exercises. New stand-alone chapters give a systematic account of the 'special functions' of physical science, cover an extended range of practical applications of complex variables, and give an introduction to quantum operators. Further tabulations, of relevance in statistics and numerical integration, have been added. In this edition, half of the exercises are provided with hints and answers and, in a separate manual available to both students and their teachers, complete worked solutions. The remaining exercises have no hints, answers or worked solutions and can be used for unaided homework; full solutions are available to instructors on a password-protected web site, www.cambridge.org/9780521679718.

    Clear explanations are detailed with many current examples.

    The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. KEY TOPICS: In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

     -Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. -Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. -Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http: //msp.org

    For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms.