Book picks similar to
First-Order Logic by Raymond M. Smullyan
logic
math
mathematics
philosophy
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael R. Garey - 1979
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.
Thinking In Numbers: On Life, Love, Meaning, and Math
Daniel Tammet - 2012
In Tammet's world, numbers are beautiful and mathematics illuminates our lives and minds. Using anecdotes, everyday examples, and ruminations on history, literature, and more, Tammet allows us to share his unique insights and delight in the way numbers, fractions, and equations underpin all our lives. Inspired by the complexity of snowflakes, Anne Boleyn's eleven fingers, or his many siblings, Tammet explores questions such as why time seems to speed up as we age, whether there is such a thing as an average person, and how we can make sense of those we love. Thinking In Numbers will change the way you think about math and fire your imagination to see the world with fresh eyes.
The Lifebox, the Seashell, and the Soul: What Gnarly Computation Taught Me About Ultimate Reality, the Meaning of Life, and How to Be Happy
Rudy Rucker - 2005
This concept is at the root of the computational worldview, which basically says that very complex systems — the world we live in — have their beginnings in simple mathematical equations. We've lately come to understand that such an algorithm is only the start of a never-ending story — the real action occurs in the unfolding consequences of the rules. The chip-in-a-box computers so popular in our time have acted as a kind of microscope, letting us see into the secret machinery of the world. In Lifebox, Rucker uses whimsical drawings, fables, and humor to demonstrate that everything is a computation — that thoughts, computations, and physical processes are all the same. Rucker discusses the linguistic and computational advances that make this kind of "digital philosophy" possible, and explains how, like every great new principle, the computational world view contains the seeds of a next step.
The Riemann Hypothesis: The Greatest Unsolved Problem in Mathematics
Karl Sabbagh - 2002
They speak of it in awed terms and consider it to be an even more difficult problem than Fermat's last theorem, which was finally proven by Andrew Wiles in 1995.In The Riemann Hypothesis, acclaimed author Karl Sabbagh interviews some of the world's finest mathematicians who have spent their lives working on the problem--and whose approaches to meeting the challenges thrown up by the hypothesis are as diverse as their personalities.Wryly humorous, lively, accessible and comprehensive, The Riemann Hypothesis is a compelling exploration of the people who do math and the ideas that motivate them to the brink of obsession--and a profound meditation on the ultimate meaning of mathematics.