Godel, Escher, Bach: An Eternal Golden Braid
by Douglas R. Hofstadter
from Basic Books
Twenty years after it topped the bestseller charts, Douglas R. Hofstadter's Gödel, Escher, Bach: An Eternal Golden Braid is still something of a marvel. Besides being a profound and entertaining meditation on human thought and creativity, this book looks at the surprising points of contact between the music of Bach, the artwork of Escher, and the mathematics of Gödel. It also looks at the prospects for computers and artificial intelligence (AI) for mimicking human thought. For the general reader and the computer techie alike, this book still sets a standard for thinking about the future of computers and their relation to the way we think.
Hofstadter's great achievement in Gödel, Escher, Bach was making abstruse mathematical topics (like undecidability, recursion, and 'strange loops') accessible and remarkably entertaining. Borrowing a page from Lewis Carroll (who might well have been a fan of this book), each chapter presents dialogue between the Tortoise and Achilles, as well as other characters who dramatize concepts discussed later in more detail. Allusions to Bach's music (centering on his Musical Offering) and Escher's continually paradoxical artwork are plentiful here. This more approachable material lets the author delve into serious number theory (concentrating on the ramifications of Gödel's Theorem of Incompleteness) while stopping along the way to ponder the work of a host of other mathematicians, artists, and thinkers.
The world has moved on since 1979, of course. The book predicted that computers probably won't ever beat humans in chess, though Deep Blue beat Garry Kasparov in 1997. And the vinyl record, which serves for some of Hofstadter's best analogies, is now left to collectors. Sections on recursion and the graphs of certain functions from physics look tantalizing, like the fractals of recent chaos theory. And AI has moved on, of course, with mixed results. Yet Gödel, Escher, Bach remains a remarkable achievement. Its intellectual range and ability to let us visualize difficult mathematical concepts help make it one of this century's best for anyone who's interested in computers and their potential for real intelligence. --Richard Dragan
Topics Covered: J.S. Bach, M.C. Escher, Kurt Gödel: biographical information and work, artificial intelligence (AI) history and theories, strange loops and tangled hierarchies, formal and informal systems, number theory, form in mathematics, figure and ground, consistency, completeness, Euclidean and non-Euclidean geometry, recursive structures, theories of meaning, propositional calculus, typographical number theory, Zen and mathematics, levels of description and computers; theory of mind: neurons, minds and thoughts; undecidability; self-reference and self-representation; Turing test for machine intelligence.
How to Solve It: A New Aspect of Mathematical Method (Princeton Science Library)
by G. Polya
from Princeton University Press
A perennial bestseller by eminent mathematician G. Polya, How to Solve It will show anyone in any field how to think straight.
In lucid and appealing prose, Polya reveals how the mathematical method of demonstrating a proof or finding an unknown can be of help in attacking any problem that can be "reasoned" out--from building a bridge to winning a game of anagrams. Generations of readers have relished Polya's deft--indeed, brilliant--instructions on stripping away irrelevancies and going straight to the heart of the problem.
In this best-selling classic, George Pólya revealed how the mathematical method of demonstrating a proof or finding an unknown can be of help in attacking any problem that can be "reasoned" out--from building a bridge to winning a game of anagrams. Generations of readers have relished Pólya's deft instructions on stripping away irrelevancies and going straight to the heart of a problem. How to Solve It popularized heuristics, the art and science of discovery and invention. It has been in print continuously since 1945 and has been translated into twenty-three different languages.
Pólya was one of the most influential mathematicians of the twentieth century. He made important contributions to a great variety of mathematical research: from complex analysis to mathematical physics, number theory, probability, geometry, astronomy, and combinatorics. He was also an extraordinary teacher--he taught until he was ninety--and maintained a strong interest in pedagogical matters throughout his long career. In addition to How to Solve It, he published a two-volume work on the topic of problem solving, Mathematics of Plausible Reasoning, also with Princeton.
Pólya is one of the most frequently quoted mathematicians, and the following statements from How to Solve It make clear why: "My method to overcome a difficulty is to go around it." "Geometry is the science of correct reasoning on incorrect figures." "In order to solve this differential equation you look at it till a solution occurs to you."
Analysis: With an Introduction to Proof (4th Edition)
by Steven R. Lay
from Prentice Hall
By introducing logic and by emphasizing the structure and nature of the arguments used, this book helps readers transition from computationally oriented mathematics to abstract mathematics with its emphasis on proofs. Uses clear expositions and examples, helpful practice problems, numerous drawings, and selected hints/answers. Offers a new boxed review of key terms after each section. Rewrites many exercises. Features more than 250 true/false questions. Includes more than 100 practice problems. Provides exceptionally high-quality drawings to illustrate key ideas. Provides numerous examples and more than 1,000 exercises. A thorough reference for readers who need to increase or brush up on their advanced mathematics skills.
The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine
by Charles Petzold
from Wiley
Programming Legend Charles Petzold unlocks the secrets of the extraordinary and prescient 1936 paper by Alan M. Turing
Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of computability theory in the process, a foundation of present-day computer programming.
The book expands Turing’s original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing’s statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others.
Interwoven into the narrative are the highlights of Turing’s own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41.
How to Prove It: A Structured Approach
by Daniel J. Velleman
from Cambridge University Press
Geared to preparing students to make the transition from solving problems to proving theorems, this text teaches them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5
Beginning with the basic concepts of logic and set theory, this book teaches the language of mathematics and how it is interpreted. The author uses these concepts as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. He shows how complex proofs are built up from these smaller steps, using detailed "scratch work" sections to expose the machinery of proofs about the natural numbers, relations, functions, and infinite sets. To give students the opportunity to construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software.
Logic: A Very Short Introduction (Very Short Introductions)
by Graham Priest
from Oxford University Press, USA
Logic is often perceived as having little to do with the rest of philosophy, and even less to do with real life. In this lively and accessible introduction, Graham Priest shows how wrong this conception is. He explores the philosophical roots of the subject, explaining how modern formal logic deals with issues ranging from the existence of God and the reality of time to paradoxes of probability and decision theory. Along the way, the basics of formal logic are explained in simple, non-technical terms, showing that logic is a powerful and exciting part of modern philosophy.
How to Read and Do Proofs: An Introduction to Mathematical Thought Processes
by Daniel Solow
from Wiley
An easy-to-use guide that shows how to read, understand, and do proofs.
- 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.
Problem Solving Strategies: Crossing the River with Dogs and Other Mathematical Adventures (2nd Edition)
Problem Solving Strategies Crossing the River with Dogs and Other Mathematical Adventures Why Teach a Course in Problem Solving? The NCTM Principles andStandards state that problem solving should be integrated throughout all courses and grade levels. For example, guess-and-check is a natural strategy to apply in algebra. Advanced math students often use finite differences to study functions and sequences. And drawing a diagram and using physical representations are commonly employed strategies in many contexts. However, many students never encounter valuable strategies such as matrix logic or unit analysis. And in content-crowded math classes, few students get the concentrated practice or time necessary to fully develop their problem-solving skills. By taking a semester course in problem solving, students can master a multitude of strategies while developing confidence in their problem-solving abilities. Your students will be better prepared to meet the challenges of school and life by taking this course.
+++



