Mehr lesen
Inhaltsverzeichnis
Preface; 1. Yes you can prove a negative!; 2. Bell's impossibility theorem(s); 3. Enjoying Bell magic; 4. Arrow's (and friends') impossibility theorems; 5. Clustering and impossibility; 6. Gödel-ish impossibility; 7. Turing undecidability and incompleteness; 8. Chaitin's theorem: More devastating; 9. Gödel (for real, this time).
Über den Autor / die Autorin
Dan Gusfield is Distinguished Professor emeritus, and former department chair, in the Computer Science Department at University of California, Davis. He is a Fellow of the ACM, the IEEE, and the ISCB. His previous books are 'The Stable Marriage Problem' (1989, co-authored with Rob Irving); 'Strings, Trees and Sequences' (1997); 'ReCombinatorics' (2014); and 'Integer Linear Programming in Computational and Systems Biology' (2019). As this book reflects, his teaching emphasized mathematical rigor as well as accessibility and clarity. He produced over 100 hours of video lectures on a wide range of topics, now viewed over a million times on the web.
