
Proven Impossible: Elementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More
Inclusive of all applicable taxes. FREE shipping on all orders.
Available Offers
- 🚚Free Delivery — Free shipping on all orders
- 💵Cash on Delivery — Pay when your order arrives
- ↩️15-Day Easy Returns — Hassle-free return policy
- 🔒Cash on Delivery — Pay safely when your order arrives
Check Delivery
Product Description
Introduction
What if some of the most profound truths in mathematics, computer science, and even physics are actually about what cannot be done? Proven Impossible: Elementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More by Dan Gusfield invites you on a thrilling intellectual journey. This hardcover volume from Cambridge University Press dismantles the myth that 'you can't prove a negative' by presenting crystal-clear, elementary proofs of revolutionary impossibility theorems. Written for curious minds without specialized training, this book shows that the deepest limits of logic, computation, fairness, and the universe can be understood using only arithmetic and basic reasoning.
Book Overview
This book is the first of its kind to make the most famous impossibility proofs accessible to a broad, lay audience. Dan Gusfield has reworked rigorous mathematical arguments from the original literature, stripping away jargon and dense notation. Instead, you get intuitive explanations, step-by-step reasoning, worked examples, and exercises that build understanding from first principles. The proofs covered include Arrow's impossibility theorem (social choice), Bell's theorem (quantum mechanics), Chaitin's incompleteness (algorithmic information), Gödel's incompleteness (logic), Turing's halting problem (computability), and many more. Each proof is developed from nothing but basic arithmetic and logical deduction — no advanced math required.
Key Highlights
- First-of-its-kind presentation: The simplest rigorous proofs of impossibility theorems, reworked for non-specialists.
- No prerequisites: Only a willingness to follow logical arguments and a pen in hand are needed.
- Broad scope: Covers landmark results from Arrow, Bell, Chaitin, Gödel, Turing, and other giants.
- Interactive learning: Each proof is accompanied by background, intuition, examples, and exercises to solidify understanding.
- Beautiful hardcover edition: Published by Cambridge University Press, a hallmark of academic excellence.
Inside the Book
Open the cover and you'll find a carefully structured journey. The book begins with foundational concepts — what a proof is, how to read a logical argument, and the idea of impossibility itself. Then, each chapter introduces a famous impossibility theorem, starting with its historical context and real-world significance. The proof unfolds slowly: definitions are clarified, each step is justified, and potential pitfalls are highlighted. Exercises at the end of each chapter let you test your grasp. By the final pages, you'll have walked through the very arguments that won Nobel Prizes and shaped modern computing, democracy, and physics.
Key Topics
- Arrow's Impossibility Theorem and the limits of fair voting systems
- Bell's Theorem and the impossibility of local hidden variables in quantum mechanics
- Chaitin's Incompleteness Theorem and algorithmic randomness
- Gödel's Incompleteness Theorems and the limits of formal systems
- Turing's Halting Problem and the boundaries of computation
- Other impossibility results from geometry, game theory, and number theory
Reader Benefits
- Deepen your understanding: Move beyond hearsay and truly grasp why these theorems are true.
- Sharpen logical thinking: Each proof is a masterclass in clear, step-by-step reasoning.
- Connect disciplines: See how impossibility links mathematics, computer science, philosophy, and physics.
- Build confidence: No prior expertise needed — the book meets you where you are.
- Enjoy a lasting reference: The hardcover edition is built to last on your bookshelf.
Learning Outcomes
By the time you finish Proven Impossible, you will be able to: explain the core ideas behind each impossibility theorem in plain language; reconstruct the elementary proofs from memory; appreciate the philosophical and practical implications of these results; and apply the same logical rigor to other problems. You'll also gain a profound respect for the power of negative results — the kind that redefine entire fields.
Who Should Read
This book is for anyone with a curious mind and a love for logical puzzles. It's ideal for Indian students in Class 11 and 12 who are preparing for competitive exams and want to go beyond the syllabus. College undergraduates in mathematics, computer science, physics, economics, or philosophy will find it a treasure. Teachers and professors looking for fresh ways to explain these theorems will also benefit. And if you're simply a lifelong learner who enjoys being challenged and amazed, this book is for you.
About the Author
Dan Gusfield is a Distinguished Professor of Computer Science at the University of California, Davis. He is known for his deep contributions to algorithms, combinatorial optimization, and computational biology. With decades of teaching experience, Gusfield has a gift for making complex ideas accessible without sacrificing rigor. His previous books, including Algorithms on Strings, Trees, and Sequences, are widely used in graduate courses worldwide. In Proven Impossible, he brings that same clarity to the most celebrated impossibility proofs.
About the Publisher
Cambridge University Press is one of the world's oldest and most prestigious academic publishers, with a history dating back to 1534. Known for its rigorous editorial standards and commitment to scholarly excellence, Cambridge publishes works that shape research and education globally. This hardcover edition upholds that tradition, offering a beautifully produced volume that is both intellectually stimulating and durable for years of use.
Conclusion
Proven Impossible is not just a book — it's an invitation to think differently about what is possible. By mastering these elementary proofs, you'll join a select group of people who truly understand why certain things can never be done. Whether you're a student, a teacher, or a curious reader in India, this book will expand your mind and leave you with a lasting sense of wonder. Order your copy from Bookshops.in today and embark on a journey to the frontiers of human knowledge.
Quick Summary
Proven Impossible: Elementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More by Dan Gusfield is a groundbreaking book that makes deep impossibility theorems accessible to everyone. It presents the simplest rigorous proofs of results that have shaped modern mathematics, computer science, economics, and physics. Readers will learn why certain things are fundamentally impossible—whether it's a perfect voting system, a complete mathematical theory, or a program that can decide if any other program halts. The book uses only elementary arithmetic and basic logic, with extensive background, intuition, examples, and exercises. It is perfect for Indian students, self-learners, and anyone curious about the limits of knowledge. By buying from Bookshops.in, you get a premium hardcover edition from Cambridge University Press, carefully packaged and delivered across India. This book will transform how you think about impossibility and the foundations of science.
Book Highlights
Book Specifications
| ISBN-13 | 9781009349505 |
| ISBN-10 | 1009349503 |
| Publisher | Cambridge University Press |
| Language | English |
| Dimensions | 15.24 x 2.54 x 22.86 cm |
| Weight | 520 g |
| Country | India |
| Category | Languages › C & C++ |
| Genre | Non-fiction |
| Reading Age | 18+ |
| Original Language | English |
Frequently Asked Questions
What is Proven Impossible about?
Who is the author of Proven Impossible?
Do I need advanced math to understand this book?
Which theorems are covered in this book?
Is this book suitable for Indian students?
How is this book different from other math books?
Does the book include exercises?
Can I use this book for self-study?
Is this book related to Nobel Prize-winning work?
Where can I buy Proven Impossible in India?
Does the book cover Turing's halting problem?
What makes the proofs in this book 'elementary'?
Readers Also Search For
Customers Also Bought

Programming
Algorithmische Sprache Und Programmentwicklung | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer

Programming
Distributed Algorithms | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean

Programming
Meta-Level Control for Deductive Database Systems | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schm

Programming
Java Web Services | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'

Programming
Database in Depth | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J.

Programming
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problem | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson |
Related Products
View All
Computers & Internet
Modern Full-Stack React Projects by Daniel Bugl

Computers & Internet
Mootools 1.2 Beginner's Guide (English, Jacob Gube)

Computers & Internet
Contemporary Methods for Speech Parameterization (Springerbriefs in Electrical and Computer Engineering / Springerbriefs in Speech Technology)

Computers & Internet
Information Technology and Lawyers | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lo

Computers & Internet
Digital Analysis of Remotely Sensed Imagery | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao

Computers & Internet
