This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
This elegant little book discusses a famous problem that helped to define the field now known as graph theory: what is the minimum number of colors required to print a map such that no two adjoining countries have the same color, no matter how convoluted their boundaries are. Many famous mathematicians have worked on the problem, but the proof eluded formulation until the 1970s, when it was finally cracked with a brute-force approach using a computer. The Four-Color Theorem begins by discussing the history of the problem up to the new approach given in the 1990s (by Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas). The book then goes into the mathematics, with a detailed discussion of how to convert the originally topological problem into a combinatorial one that is both elementary enough that anyone with a basic knowledge of geometry can follow it and also rigorous enough that a mathematician can read it with satisfaction. The authors discuss the mathematics and point to the philosophical debate that ensued when the proof was announced: just what is a mathematical proof, if it takes a computer to provide one - and is such a thing a proof at all?
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Last Exit Books, Charlottesville, VA, USA
Hardcover. Zustand: Very Good. Hardcover. 8vo. Published by Springer, New York, 1998. Xvi, 260 pages. Second Printing. Bound in cloth boards with titles present to the spine and front board. Boards have light shelf-wear present to the extremities. No ownership marks present. Text is clean and free of marks. Binding tight and solid. "This elegant little book discusses a famous problem that helped to define the field now known as graph theory: what is the minimum number of colors required to print a map such that no two adjoining countries have the same color, no matter how convoluted their boundaries are. Many famous mathematicians have worked on the problem, but the proof eluded formulation until the 1970s, when it was finally cracked with a brute-force approach using a computer." "The Four-Color Theorem begins by discussing the history of the problem up to the new approach given in the 1990s (by Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas). The book then goes into the mathematics, with a detailed discussion of how to convert the originally topological problem into a combinatorial one that is both elementary enough that anyone with a basic knowledge of geometry can follow it and also rigorous enough that a mathematician can read it with satisfaction. The authors discuss the mathematics and point to the philosophical debate that ensued when the proof was announced: just what is a mathematical proof, if it takes a computer to provide one - and is such a thing a proof at all?"; 9.5 X 6.4 X 0.7 inches; 260 pages. Artikel-Nr. 71439
Anzahl: 1 verfügbar
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 FRI 9780387984971 Sprache: Englisch Gewicht in Gramm: 550. Artikel-Nr. 2498595
Anzahl: 1 verfügbar
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 FRI 9780387984971 Sprache: Englisch Gewicht in Gramm: 550. Artikel-Nr. 2502670
Anzahl: 1 verfügbar
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABBB-161526
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: Used. pp. xvi + 260. Artikel-Nr. 18296654
Anzahl: 1 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. xvi + 260. Artikel-Nr. 7551259
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780387984971_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 280 | Sprache: Englisch | Produktart: Bücher | This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs. Artikel-Nr. 304502/202
Anzahl: 1 verfügbar
Anbieter: Mooney's bookstore, Den Helder, Niederlande
Zustand: Very good. Artikel-Nr. E-9780387984971-2-2
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 1st edition. 260 pages. 9.75x6.50x0.75 inches. In Stock. Artikel-Nr. x-0387984976
Anzahl: 2 verfügbar