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.

    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.

    An extremely clever account.--The New Yorker.

    Distinguishing agents (e.g., molecules, cells, animals, and species) from their interactions (e.g., chemical reactions, immune system responses, sexual reproduction, and evolution), Flake argues that it is the computational properties of interactions that account for much of what we think of as beautiful and interesting. From this basic thesis, Flake explores what he considers to be today's four most interesting computational topics: fractals, chaos, complex systems, and adaptation.Each of the book's parts can be read independently, enabling even the casual reader to understand and work with the basic equations and programs. Yet the parts are bound together by the theme of the computer as a laboratory and a metaphor for understanding the universe. The inspired reader will experiment further with the ideas presented to create fractal landscapes, chaotic systems, artificial life forms, genetic algorithms, and artificial neural networks.

    To meet it, you need a fully integrated text and supplements package that sets the stage for a perfectly choreographed learning experience.

    First published in 1986, this mind-boggling and entertaining dictionary, arranged in order of magnitude, exposes the fascinating facts about certain numbers and number sequences - very large primes, amicable numbers and golden squares to give but a few examples.

    Topics covered include matrix multiplication, row reduction, matrix inverse, orthogonality and computation. The self-teaching book is loaded with examples and graphics and provides a wide array of probing problems, accompanying solutions, and a glossary. Chapter 1: Introduction to Vectors; Chapter 2: Solving Linear Equations; Chapter 3: Vector Spaces and Subspaces; Chapter 4: Orthogonality; Chapter 5: Determinants; Chapter 6: Eigenvalues and Eigenvectors; Chapter 7: Linear Transformations; Chapter 8: Applications; Chapter 9: Numerical Linear Algebra; Chapter 10: Complex Vectors and Matrices; Solutions to Selected Exercises; Final Exam. Matrix Factorizations. Conceptual Questions for Review. Glossary: A Dictionary for Linear Algebra Index Teaching Codes Linear Algebra in a Nutshell.

    He discovered the Conway groups in mathematical symmetry, and invented the aptly named surreal numbers, as well as the cult classic Game of Life--more than a cool fad, Life demonstrates how simplicity generates complexity and the game provides an analogy for all mathematics and the entire universe. Moving to Princeton in 1987, as a mathemagician he deployed cards, ropes, dice, coat hangers, and even the odd Slinky as props to extend his winning imagination and share his mathy obsessions with signature contagion. He is a jet-setting ambassador-at-large for the beauties of all things mathematical.Genius At Play is an intimate investigation into the mind of an endearing genius, laying bare Conway's personal and professional idiosyncrasies. The intimacy comes courtesy of the man himself. He generously granted Roberts full access, though not without the occasional grudge and grumble: "Oh hell," he'd say. "You're not going to put that in the book. Are you?!?

    Providing a concise introduction to abstract algebra, this work unfolds some of the fundamental systems with the aim of reaching applicable, significant results.

    Reuben Hersh argues the contrary, that mathematics must be understood as a human activity, a social phenomenon, part of human culture, historically evolved, and intelligible only in a social context. Hersh pulls the screen back to reveal mathematics as seen by professionals, debunking many mathematical myths, and demonstrating how the humanist idea of the nature of mathematics more closely resembles how mathematicians actually work. At the heart of his book is a fascinating historical account of the mainstream of philosophy--ranging from Pythagoras, Descartes, and Spinoza, to Bertrand Russell, David Hilbert, and Rudolph Carnap--followed by the mavericks who saw mathematics as a human artifact, including Aristotle, Locke, Hume, Mill, and Lakatos.What is Mathematics, Really? reflects an insider's view of mathematical life, and will be hotly debated by anyone with an interest in mathematics or the philosophy of science.

    But there is one other motive which is as strong as any of these — the search for beauty. Mathematics is an art, and as such affords the pleasures which all the arts afford." In this erudite, entertaining college-level text, Morris Kline, Professor Emeritus of Mathematics at New York University, provides the liberal arts student with a detailed treatment of mathematics in a cultural and historical context. The book can also act as a self-study vehicle for advanced high school students and laymen. Professor Kline begins with an overview, tracing the development of mathematics to the ancient Greeks, and following its evolution through the Middle Ages and the Renaissance to the present day. Subsequent chapters focus on specific subject areas, such as "Logic and Mathematics," "Number: The Fundamental Concept," "Parametric Equations and Curvilinear Motion," "The Differential Calculus," and "The Theory of Probability." Each of these sections offers a step-by-step explanation of concepts and then tests the student's understanding with exercises and problems. At the same time, these concepts are linked to pure and applied science, engineering, philosophy, the social sciences or even the arts.In one section, Professor Kline discusses non-Euclidean geometry, ranking it with evolution as one of the "two concepts which have most profoundly revolutionized our intellectual development since the nineteenth century." His lucid treatment of this difficult subject starts in the 1800s with the pioneering work of Gauss, Lobachevsky, Bolyai and Riemann, and moves forward to the theory of relativity, explaining the mathematical, scientific and philosophical aspects of this pivotal breakthrough. Mathematics for the Nonmathematician exemplifies Morris Kline's rare ability to simplify complex subjects for the nonspecialist.

    Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics. Beginning in antiquity with Democritus, it progresses through logic and set theory, computability and complexity theory, quantum computing, cryptography, the information content of quantum states and the interpretation of quantum mechanics. There are also extended discussions about time travel, Newcomb's Paradox, the anthropic principle and the views of Roger Penrose. Aaronson's informal style makes this fascinating book accessible to readers with scientific backgrounds, as well as students and researchers working in physics, computer science, mathematics and philosophy.

    This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants.Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

    Shows how any proof can be understood as a sequence of techniques. Covers the full range of techniques used in proofs, such as the contrapositive, induction, and proof by contradiction. Explains how to identify which techniques are used and how they are applied in the specific problem. Illustrates how to read written proofs with many step-by-step examples. Includes new, expanded appendices related to discrete mathematics, linear algebra, modern algebra and real analysis.

    This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures.The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary onthe puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking throughmore difficult puzzles.