Cantitate/Preț
Produs

Proven Impossible

Autor Dan Gusfield
en Limba Engleză Paperback – 28 noi 2023
In mathematics, it simply is not true that 'you can't prove a negative'. Many revolutionary impossibility theorems reveal profound properties of logic, computation, fairness and the universe, and form the mathematical background of new technologies and Nobel prizes. But to fully appreciate these theorems and their impact on mathematics and beyond, you must understand their proofs. This book is the first to present these proofs for a broad, lay audience. It fully develops the simplest rigorous proofs found in the literature, reworked to contain less jargon and notation, and more background, intuition, examples, explanations, and exercises. Amazingly, all of the proofs in this book involve only arithmetic and basic logic – and are elementary, starting only from first principles and definitions. Very little background knowledge is required, and no specialized mathematical training – all you need is the discipline to follow logical arguments and a pen in your hand.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 19123 lei  3-5 săpt. +8030 lei  6-12 zile
  Cambridge University Pr. – 28 noi 2023 19123 lei  3-5 săpt. +8030 lei  6-12 zile
Hardback (1) 45470 lei  6-8 săpt. +3203 lei  6-12 zile
  Cambridge University Press – 18 ian 2024 45470 lei  6-8 săpt. +3203 lei  6-12 zile

Preț: 19123 lei

Puncte Express: 287

Preț estimativ în valută:
3379 3875$ 2932£

Carte disponibilă

Livrare economică 23 aprilie-07 mai
Livrare express 08-14 aprilie pentru 9029 lei


Specificații

ISBN-13: 9781009349499
ISBN-10: 100934949X
Pagini: 256
Ilustrații: Worked examples or Exercises
Dimensiuni: 154 x 228 x 22 mm
Greutate: 0.44 kg
Editura: Cambridge University Pr.
Locul publicării:Cambridge, United Kingdom

Cuprins

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. Godel-ish impossibility; 7. Turing undecidability and incompleteness; 8. Chaitin's theorem: More devastating; 9. Godel (for real, this time).

Descriere

A highly readable presentation of elementary yet rigorous proofs of profound impossibility theorems for a broad, lay audience.