It offers a comprehensive and accessible treatment of the theory of algorithms and complexity—the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.

    Part 1, on propositional logic, is the old Introduction, but contains much new material. Part 2 is entirely new, and covers quantification and identity for all the logics in Part 1. The material is unified by the underlying theme of world semantics. All of the topics are explained clearly using devices such as tableau proofs, and their relation to current philosophical issues and debates are discussed. Students with a basic understanding of classical logic will find this book an invaluable introduction to an area that has become of central importance in both logic and philosophy. It will also interest people working in mathematics and computer science who wish to know about the area.

    It was his feeling that a proper analysis of the use of language would clarify concepts and lead to the solution of (what seem to be) philosophical problems.Sometimes, Wittgenstein's expository method is pre-Socratic: a flow of disconnected statements, not unlike Heraclitean fragments, that range from clear aphorisms to cryptic oracles. Elsewhere, there are brief Socratic dialogues with imaginary persons, opponents of equally severe seriousness, representatives of the other half of Wittgenstein strove for total clarity of language as a means of solving philosophical problems, but some of his most meaningful statements here are expressed suggestively, subjectively, poetically.

    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.

    Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

    No, hang on, let's make this interesting. Between zero and infinity. Even if you stick to the whole numbers, there are a lot to choose from - an infinite number in fact. Throw in decimal fractions and infinity suddenly gets an awful lot bigger (is that even possible?) And then there are the negative numbers, the imaginary numbers, the irrational numbers like pi which never end. It literally never ends.The world of numbers is indeed strange and beautiful. Among its inhabitants are some really notable characters - pi, e, the "imaginary" number i and the famous golden ratio to name just a few. Prime numbers occupy a special status. Zero is very odd indeed: is it a number, or isn't it?How Numbers Work takes a tour of this mind-blowing but beautiful realm of numbers and the mathematical rules that connect them. Not only that, but take a crash course on the biggest unsolved problems that keep mathematicians up at night, find out about the strange and unexpected ways mathematics influences our everyday lives, and discover the incredible connection between numbers and reality itself. ABOUT THE SERIESNew Scientist Instant Expert books are definitive and accessible entry points to the most important subjects in science; subjects that challenge, attract debate, invite controversy and engage the most enquiring minds. Designed for curious readers who want to know how things work and why, the Instant Expert series explores the topics that really matter and their impact on individuals, society, and the planet, translating the scientific complexities around us into language that's open to everyone, and putting new ideas and discoveries into perspective and context.

    Students, researchers, historians, specialists — in short, everyone with an interest in mathematics — will find it engrossing and stimulating.Beginning with the ancient Near East, the author traces the ideas and techniques developed in Egypt, Babylonia, China, and Arabia, looking into such manuscripts as the Egyptian Papyrus Rhind, the Ten Classics of China, and the Siddhantas of India. He considers Greek and Roman developments from their beginnings in Ionian rationalism to the fall of Constantinople; covers medieval European ideas and Renaissance trends; analyzes 17th- and 18th-century contributions; and offers an illuminating exposition of 19th century concepts. Every important figure in mathematical history is dealt with — Euclid, Archimedes, Diophantus, Omar Khayyam, Boethius, Fermat, Pascal, Newton, Leibniz, Fourier, Gauss, Riemann, Cantor, and many others.For this latest edition, Dr. Struik has both revised and updated the existing text, and also added a new chapter on the mathematics of the first half of the 20th century. Concise coverage is given to set theory, the influence of relativity and quantum theory, tensor calculus, the Lebesgue integral, the calculus of variations, and other important ideas and concepts. The book concludes with the beginnings of the computer era and the seminal work of von Neumann, Turing, Wiener, and others."The author's ability as a first-class historian as well as an able mathematician has enabled him to produce a work which is unquestionably one of the best." — Nature Magazine.

    Since its publication in 1908, it has been a classic work to which successive generations of budding mathematicians have turned at the beginning of their undergraduate courses. In its pages, Hardy combines the enthusiasm of a missionary with the rigor of a purist in his exposition of the fundamental ideas of the differential and integral calculus, of the properties of infinite series and of other topics involving the notion of limit.

    The new edition features additional styles and functions, improved font handling, and enhanced graphics capabilities. Other parts of the book have been revised to reflect user comments and suggestions. Selected sections have been rewritten to explain challenging concepts or functions, and the descriptions of both MakeIndex and BibTEX have been updated. New LATEX users will want to start with this book, and current users, particularly as they upgrade to the LATEX2e software, will be eager to obtain the most up-to-date version of its associated manual. Features Revised version of the authoritative user's guide and reference manual for the LATEX computer typesetting system. Features the new standard software release - LATEX2e. Sections rewritten to explain difficult concepts or functions.

    Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics — profusely illustrated — include: Mathematical Models, Elementary Concepts of Graph Theory, Transportation Problems, Connection Problems, Party Problems, Digraphs and Mathematical Models, Games and Puzzles, Graphs and Social Psychology, Planar Graphs and Coloring Problems, and Graphs and Other Mathematics. A useful Appendix covers Sets, Relations, Functions, and Proofs, and a section devoted to exercises — with answers, hints, and solutions — is especially valuable to anyone encountering graph theory for the first time. Undergraduate mathematics students at every level, puzzlists, and mathematical hobbyists will find well-organized coverage of the fundamentals of graph theory in this highly readable and thoroughly enjoyable book.

    It provides students with skills that will enable them to make productive use of computational techniques, including some of the tools and techniques of "data science" for using computation to model and interpret data. The book is based on an MIT course (which became the most popular course offered through MIT's OpenCourseWare) and was developed for use not only in a conventional classroom but in in a massive open online course (or MOOC) offered by the pioneering MIT--Harvard collaboration edX.Students are introduced to Python and the basics of programming in the context of such computational concepts and techniques as exhaustive enumeration, bisection search, and efficient approximation algorithms. The book does not require knowledge of mathematics beyond high school algebra, but does assume that readers are comfortable with rigorous thinking and not intimidated by mathematical concepts. Although it covers such traditional topics as computational complexity and simple algorithms, the book focuses on a wide range of topics not found in most introductory texts, including information visualization, simulations to model randomness, computational techniques to understand data, and statistical techniques that inform (and misinform) as well as two related but relatively advanced topics: optimization problems and dynamic programming.Introduction to Computation and Programming Using Python can serve as a stepping-stone to more advanced computer science courses, or as a basic grounding in computational problem solving for students in other disciplines.

    Discovered by an 18th century mathematician and preacher, Bayes' rule is a cornerstone of modern probability theory. In this richly illustrated book, intuitive visual representations of real-world examples are used to show how Bayes' rule is actually a form of commonsense reasoning. The tutorial style of writing, combined with a comprehensive glossary, makes this an ideal primer for novices who wish to gain an intuitive understanding of Bayesian analysis. As an aid to understanding, online computer code (in MatLab, Python and R) reproduces key numerical results and diagrams.Stone's book is renowned for its visually engaging style of presentation, which stems from teaching Bayes' rule to psychology students for over 10 years as a university lecturer.

    If you want to leverage OpenGL 2.1's major improvements, you really need the Fourth Edition. It's a comprehensive tutorial, systematic API reference, and massive code library, all in one. You'll start with the fundamental techniques every graphics programmer needs: transformations, lighting, texture mapping, and so forth. Then, building on those basics, you'll move towards newer capabilities, from advanced buffers to vertex shaders. Of course, OpenGL's cross-platform availability remains one of its most compelling features. This book's extensive multiplatform coverage has been thoroughly rewritten, and now addresses everything from Windows Vista to OpenGL ES for handhelds. This is stuff you absolutely want the latest edition for. A small but telling point: This book's recently been invited into Addison-Wesley's OpenGL Series, making it an "official" OpenGL book -- and making a powerful statement about its credibility. Bill Camarda, from the August 2007 href="http://www.barnesandnoble.com/newslet... Only

    In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. He also explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets.In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem.

    Publilius Syrus, Moral Sayings We've been very fortunate to receive fantastic feedback from our readers during the last four years, since the first edition of How to Solve It: Modern Heuristics was published in 1999. It's heartening to know that so many people appreciated the book and, even more importantly, were using the book to help them solve their problems. One professor, who published a review of the book, said that his students had given the best course reviews he'd seen in 15 years when using our text. There can be hardly any better praise, except to add that one of the book reviews published in a SIAM journal received the best review award as well. We greatly appreciate your kind words and personal comments that you sent, including the few cases where you found some typographical or other errors. Thank you all for this wonderful support.