Coverart for item
The Resource People, problems, and proofs : essays from Gödel's Lost Letter: 2010, Richard J. Lipton, Kenneth W. Regan

People, problems, and proofs : essays from Gödel's Lost Letter: 2010, Richard J. Lipton, Kenneth W. Regan

Label
People, problems, and proofs : essays from Gödel's Lost Letter: 2010
Title
People, problems, and proofs
Title remainder
essays from Gödel's Lost Letter: 2010
Statement of responsibility
Richard J. Lipton, Kenneth W. Regan
Creator
Contributor
Subject
Language
eng
Summary
People, problems, and proofs are the lifeblood of theoretical computer science. Behind the computing devices and applications that have transformed our lives are clever algorithms, and for every worthwhile algorithm there is a problem that it solves and a proof that it works. Before this proof there was an open problem: can one create an efficient algorithm to solve the computational problem?
Cataloging source
E7B
http://library.link/vocab/creatorName
Lipton, Richard J
Dewey number
004.0151
Illustrations
illustrations
Index
no index present
LC call number
QA267.7
LC item number
.L57 2013eb
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
NLM call number
QA 267.7
http://library.link/vocab/relatedWorkOrContributorName
Regan, Kenneth W
http://library.link/vocab/subjectName
  • Computational complexity
  • Information theory
  • Information Theory
  • Computing Methodologies
  • Computer Science
  • Theory of Computation
  • History of Computing
  • Mathematics of Computing
  • History of Mathematical Sciences
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • Computational complexity
  • Information theory
Label
People, problems, and proofs : essays from Gödel's Lost Letter: 2010, Richard J. Lipton, Kenneth W. Regan
Instantiates
Publication
Copyright
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • People, Problems, and Proofs; Preface; Contents; Chapter 1: The Claimant, the Readers, and the Crowd; 1.1 The News; 1.2 The Paper and First Post; 1.3 My Snap-Doubt and Comment; 1.4 Comments and Comments and Comments; 1.5 Back to the Future; 1.6 The Group; 1.7 Internet Non-resistance; 1.8 Company ... ; 1.9 ... And a Crowd; 1.10 The Issues Crystallize; 1.11 The Falling Action; 1.12 What Did We Learn?; 1.13 Notes and Links; Chapter 2: Kenneth Iverson: Notation and Thinking; 2.1 Good Notation; 2.2 Good Notation?; 2.3 Open Problems; 2.4 Notes and Links
  • 13.2 All for the Price of One13.3 Finding Triangles; 13.4 One Bit, Two Bits, Three Bits, n Bits; 13.5 Open Problems; 13.6 Notes and Links; Chapter 14: Adam Smith: Dumb Channels; 14.1 Computationally Limited Channels; 14.2 The New Results; 14.3 Open Problems; 14.4 Notes and Links; Chapter 15: Georg Cantor: Diagonal Method; 15.1 Proofs; 15.2 A Variant of the Classic Proof; 15.3 A Probability-Based Proof; 15.4 Open Problems; 15.5 Notes and Links; Chapter 16: Raymond Smullyan: The Reals Are Uncountable; 16.1 Alice and Bob Play Some Games; 16.2 Let's Look at Bob's Strategies
  • 6.2 Act II: The Conjecture's Applications6.3 Act III: Is It True?; 6.4 A Comment on Expanders; 6.5 Open Problems; 6.6 Notes and Links; Chapter 7: Arno van den Essen: An Amazing Conjecture; 7.1 The Jacobian Conjecture; 7.2 JC Approaches; 7.3 Amazing Conjectures; 7.4 Open Problems; 7.5 Notes and Links; Chapter 8: Richard Hamilton: Group Efforts; 8.1 Fermat's Last Theorem; 8.2 Applying the Idea for a Partial Result; 8.3 Poincaré Conjecture; 8.4 Unique Games Conjecture; 8.5 Open Problems; 8.6 Notes and Links; Chapter 9: Grigori Perelman: A New Clay Problem; 9.1 Problems; 9.2 Open Problems
  • 9.3 Notes and LinksChapter 10: Eric Allender: Solvable Groups; 10.1 Allender on the Permanent; 10.2 A Result to Dream of; 10.3 SOLVE; 10.4 Open Problems; 10.5 Notes and Links; Chapter 11: Enrico Bombieri: On Intuition; 11.1 Number Theory; 11.2 Geometry; 11.3 Groups; 11.4 Reid's Proof; 11.5 Complexity Theory; 11.6 Open Problems; 11.7 Notes and Links; Chapter 12: Fred Hennie: Lower Bounds; 12.1 The Models; 12.2 Hennie's Result; 12.3 Since Hennie; 12.4 Toward Even Stronger Bounds; 12.5 Open Problems; 12.6 Notes and Links; Chapter 13: Volker Strassen: Amazing Results; 13.1 Fast Matrix Product
  • Chapter 3: Edmund Hillary: Proofs and Mountain Climbing3.1 A Disclaimer; 3.2 Climbing; 3.3 Solving; 3.4 Open Problems; 3.5 Notes and Links; Chapter 4: Leonardo da Vinci: Proofs as Art; 4.1 Studying Great Art; 4.2 Studying Great Proofs; 4.3 Some Great Proofs; 4.4 What Can One Learn from This Study?; 4.5 Open Problems; 4.6 Notes and Links; Chapter 5: Michael Atiyah: The Role of Proof; 5.1 Does Any Proof Matter?; 5.2 Does a Proof of P NP Matter?; 5.3 Open Problems; 5.4 Notes and Links; Chapter 6: Subhash Khot: Unique Games Conjecture; 6.1 Act I: The Unique Games Conjecture
Control code
868924661
Dimensions
unknown
Extent
1 online resource (319 pages)
Form of item
online
Isbn
9783642414213
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-41422-0
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
585659
Specific material designation
remote
System control number
(OCoLC)868924661
Label
People, problems, and proofs : essays from Gödel's Lost Letter: 2010, Richard J. Lipton, Kenneth W. Regan
Publication
Copyright
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • People, Problems, and Proofs; Preface; Contents; Chapter 1: The Claimant, the Readers, and the Crowd; 1.1 The News; 1.2 The Paper and First Post; 1.3 My Snap-Doubt and Comment; 1.4 Comments and Comments and Comments; 1.5 Back to the Future; 1.6 The Group; 1.7 Internet Non-resistance; 1.8 Company ... ; 1.9 ... And a Crowd; 1.10 The Issues Crystallize; 1.11 The Falling Action; 1.12 What Did We Learn?; 1.13 Notes and Links; Chapter 2: Kenneth Iverson: Notation and Thinking; 2.1 Good Notation; 2.2 Good Notation?; 2.3 Open Problems; 2.4 Notes and Links
  • 13.2 All for the Price of One13.3 Finding Triangles; 13.4 One Bit, Two Bits, Three Bits, n Bits; 13.5 Open Problems; 13.6 Notes and Links; Chapter 14: Adam Smith: Dumb Channels; 14.1 Computationally Limited Channels; 14.2 The New Results; 14.3 Open Problems; 14.4 Notes and Links; Chapter 15: Georg Cantor: Diagonal Method; 15.1 Proofs; 15.2 A Variant of the Classic Proof; 15.3 A Probability-Based Proof; 15.4 Open Problems; 15.5 Notes and Links; Chapter 16: Raymond Smullyan: The Reals Are Uncountable; 16.1 Alice and Bob Play Some Games; 16.2 Let's Look at Bob's Strategies
  • 6.2 Act II: The Conjecture's Applications6.3 Act III: Is It True?; 6.4 A Comment on Expanders; 6.5 Open Problems; 6.6 Notes and Links; Chapter 7: Arno van den Essen: An Amazing Conjecture; 7.1 The Jacobian Conjecture; 7.2 JC Approaches; 7.3 Amazing Conjectures; 7.4 Open Problems; 7.5 Notes and Links; Chapter 8: Richard Hamilton: Group Efforts; 8.1 Fermat's Last Theorem; 8.2 Applying the Idea for a Partial Result; 8.3 Poincaré Conjecture; 8.4 Unique Games Conjecture; 8.5 Open Problems; 8.6 Notes and Links; Chapter 9: Grigori Perelman: A New Clay Problem; 9.1 Problems; 9.2 Open Problems
  • 9.3 Notes and LinksChapter 10: Eric Allender: Solvable Groups; 10.1 Allender on the Permanent; 10.2 A Result to Dream of; 10.3 SOLVE; 10.4 Open Problems; 10.5 Notes and Links; Chapter 11: Enrico Bombieri: On Intuition; 11.1 Number Theory; 11.2 Geometry; 11.3 Groups; 11.4 Reid's Proof; 11.5 Complexity Theory; 11.6 Open Problems; 11.7 Notes and Links; Chapter 12: Fred Hennie: Lower Bounds; 12.1 The Models; 12.2 Hennie's Result; 12.3 Since Hennie; 12.4 Toward Even Stronger Bounds; 12.5 Open Problems; 12.6 Notes and Links; Chapter 13: Volker Strassen: Amazing Results; 13.1 Fast Matrix Product
  • Chapter 3: Edmund Hillary: Proofs and Mountain Climbing3.1 A Disclaimer; 3.2 Climbing; 3.3 Solving; 3.4 Open Problems; 3.5 Notes and Links; Chapter 4: Leonardo da Vinci: Proofs as Art; 4.1 Studying Great Art; 4.2 Studying Great Proofs; 4.3 Some Great Proofs; 4.4 What Can One Learn from This Study?; 4.5 Open Problems; 4.6 Notes and Links; Chapter 5: Michael Atiyah: The Role of Proof; 5.1 Does Any Proof Matter?; 5.2 Does a Proof of P NP Matter?; 5.3 Open Problems; 5.4 Notes and Links; Chapter 6: Subhash Khot: Unique Games Conjecture; 6.1 Act I: The Unique Games Conjecture
Control code
868924661
Dimensions
unknown
Extent
1 online resource (319 pages)
Form of item
online
Isbn
9783642414213
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-41422-0
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
585659
Specific material designation
remote
System control number
(OCoLC)868924661

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...