Dana Richards – författare

The first comprehensive bibliography of the publications of polymath Martin Gardner.Martin Gardner (1914–2010) was a polymath whose international reputation extended from mathematics to literature, philosophy to science, and magic to fiction. This comprehensive bibliography covers every aspect of Gardner’s lengthy publishing career, from 1930 to 2010, and features detailed descriptions and indices of his writings on mathematics and many other topics. Editor Dana Richards worked directly with Gardner on this project from 1978 until Gardner’s death; it draws on the two hundred boxes of Gardner’s mathematical papers held in the Stanford archives

For more than twenty-five years, Martin Gardner was Scientific American's renowned provocateur of popular math. His yearly gatherings of short and inventive problems were easily his most anticipated math columns. Loyal readers would savor the wit and elegance of his explorations in physics, probability, topology, and chess, among others. Grouped by subject and arrayed from easiest to hardest, the puzzles gathered here, which complement the lengthier, more involved problems in The Colossal Book of Mathematics, have been selected by Gardner for their illuminating; and often bewildering; solutions. Filled with over 300 illustrations, this new volume even contains nine new mathematical gems that Gardner, now ninety, has been gathering for the last decade. No amateur or expert math lover should be without this indispensable volume; a capstone to Gardner's seventy-year career.

This unique compendium highlights the theory of computation, particularly logic and automata theory. Special emphasis is on computer science applications including loop invariants, program correctness, logic programming and algorithmic proof techniques.This innovative volume differs from standard textbooks, by building on concepts in a different order, using fewer theorems with simpler proofs. It has added many new examples, problems and answers. It can be used as an undergraduate text at most universities.

In 1952, Martin Gardner wrote the book Fads and Fallacies in the Name of Science, which has become a modern classic of the skeptical movement. He is best known as the Father of Recreational Mathematics, but was also a frank critic of pseudoscientists and a contributor to the Skeptical Inquirer magazine.Marcello Truzzi was one of the founders of the Committee for the Scientific Investigation of Claims of the Paranormal in 1976. He left that and founded the Center for Scientific Anomalies Research, which was more aligned with his views.Dana Richards presents the unedited, colorful correspondence between these two well-known figures within the skeptical movement as they probed and wrestled with fundamental questions such as: The demarcation problem — how to distinguish good from bad science?;How should scholars on the fringe (paranormalists) be treated?;

In 1952, Martin Gardner wrote the book Fads and Fallacies in the Name of Science, which has become a modern classic of the skeptical movement. He is best known as the Father of Recreational Mathematics, but was also a frank critic of pseudoscientists and a contributor to the Skeptical Inquirer magazine.Marcello Truzzi was one of the founders of the Committee for the Scientific Investigation of Claims of the Paranormal in 1976. He left that and founded the Center for Scientific Anomalies Research, which was more aligned with his views.Dana Richards presents the unedited, colorful correspondence between these two well-known figures within the skeptical movement as they probed and wrestled with fundamental questions such as: The demarcation problem — how to distinguish good from bad science?;How should scholars on the fringe (paranormalists) be treated?;

This text presents the formal concepts underlying Computer Science.It starts with a wide introduction to Logic with an emphasis on reasoning and proof, with chapters on Program Verification and Prolog.The treatment of computability with Automata and Formal Languages stands out in several ways:it emphasizes the algorithmic nature of the proofs and the reliance on simulations;;it stresses the centrality of nondeterminism in generative models and the relationship to deterministic recognition models;The style is appropriate for both undergraduate and graduate classes.