Proven Impossible Elementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- 1 Yes You Can Prove a Negative!
- 2 Bell’s Impossibility Theorem(s)
- 3 Enjoying Bell Magic: With Inequalities and Without
- 4 Arrow’s (and Friends’) Impossibility Theorems
- 5 Clustering and Impossibility
- 6 A Gödel-ish Impossibility and Incompleteness Theorem
- 7 Turing Undecidability and Incompleteness
- 8 Even More Devastating: Chaitin’s Incompleteness Theorem
- 9 Gödel (For Real, This Time)
- Appendix Computer Programs Are Text
- Bibliography
- Index
Contents
Published online by Cambridge University Press: 18 February 2024
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- 1 Yes You Can Prove a Negative!
- 2 Bell’s Impossibility Theorem(s)
- 3 Enjoying Bell Magic: With Inequalities and Without
- 4 Arrow’s (and Friends’) Impossibility Theorems
- 5 Clustering and Impossibility
- 6 A Gödel-ish Impossibility and Incompleteness Theorem
- 7 Turing Undecidability and Incompleteness
- 8 Even More Devastating: Chaitin’s Incompleteness Theorem
- 9 Gödel (For Real, This Time)
- Appendix Computer Programs Are Text
- Bibliography
- Index
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Proven ImpossibleElementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More, pp. vii - xiiPublisher: Cambridge University PressPrint publication year: 2024