Buy People, Problems, and Proofs by Richard J. Lipton
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010

People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010


     0     
5
4
3
2
1



Available


X
About the Book

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? And, finally, behind these questions are the people who are excited about these fundamental issues in our computational world. In this book the authors draw on their outstanding research and teaching experience to showcase some key people and ideas in the domain of theoretical computer science, particularly in computational complexity and algorithms, and related mathematical topics. They show evidence of the considerable scholarship that supports this young field, and they balance an impressive breadth of topics with the depth necessary to reveal the power and the relevance of the work described. Beyond this, the authors discuss the sustained effort of their community, revealing much about the culture of their field. A career in theoretical computer science at the top level is a vocation: the work is hard, and in addition to the obvious requirements such as intellect and training, the vignettes in this book demonstrate the importance of human factors such as personality, instinct, creativity, ambition, tenacity, and luck. The authors' style is characterize d by personal observations, enthusiasm, and humor, and this book will be a source of inspiration and guidance for graduate students and researchers engaged with or planning careers in theoretical computer science.

Table of Contents:
The Claimant, the Readers, and the Crowd.- Kenneth Iverson: Notation and Thinking.- Edmund Hillary: Proofs and Mountain Climbing.- Leonardo da Vinci: Proofs as Art.- Michael Atiyah: The Role of Proof.- Subhash Khot: Unique Games Conjecture.- Arno van den Essen: An Amazing Conjecture.- Richard Hamilton: Group Efforts.- Grigori Perelman: A New Clay Problem.- Eric Allender: Solvable Groups.- Enrico Bombieri: On Intuition.- Fred Hennie: Lower Bounds.- Volker Strassen: Amazing Results.- Adam Smith: Dumb Channels.- Georg Cantor: Diagonal Method.- Raymond Smullyan: The Reals Are Uncountable.- William Tutte: Flow Problems.- Basil Rathbone: Writing a Major Result.- Elwyn Berlekamp: Dots And Boxes.- David Johnson: Galactic Algorithms.- Warren Hirsch: Guessing The Truth.- Shimon Even: A Promise Problem.- Matei David: Improving Noam Nisan’s Generator.- Ryan Williams: A New Lower Bound.- Joel Seiferas: More on the New Lower Bound.- Victor Klee: Big Results.- George Dantzig: Equations, Equations, and Equations.- Srinivasa Ramanujan: The Role of Amateurs.- John Rhodes: Approaches to Problems.- John Nash: Connections.- Chee Yap: Computing Digits of π.- Henri Lebesgue: Projections Are Tricky.- Nina Balcan: A New Model of Complexity.- Sam Buss: Bounded Logic.- Anton Klyachko: Car Crashes.- Bernard Chazelle: Natural Algorithms.- Thomas Jech: The Axiom of Choice.- Alfonso Bedoya: Definitions, Definitions, and Definitions.- Hartley Rogers: Complexity Classes.- Ron Fagin: Second Order Logic.- Daniel Lokshtanov: Knapsack Problem.- Albert Einstein: Beyond Polynomial Equations.- Denis Thérien: Solvable Groups.- Andreas Björklund: Hamiltonian Cycles.- David Hilbert: The Nullstellensatz.- John Hopcroft: Thinking out of the Box.- Dick Karp: The Polynomial Hierarchy.- Nick Howgrave-Graham and Antoine Joux: Attacking the Knapsack Problem.- Hedy Lamarr: The Role of Amateurs.- Nicolas Courtois: The Linearization Method.- Neal Koblitz: Attacks on Crypto-systems.- Richard Feynman: Miracle Numbers.- Patrick Fischer: Programming Turing Machines.- Roger Apéry: Explaining Proofs.- Ron Rivest: Mathematical Gifts.- Frank Ryan: The Quarterback Teaches.- Leonard Schulman: Associativity.- Paul Seymour: Graph Minors.- Alfred Tarski: Lower Bounds on Theories.- Ken Thompson: Playing Chess.- Virginia Vassilevska: Fixing Tournaments.- Arkadev Chattopadhyay: Computing Modulo Composites.- Charles Bennett: Quantum Protocols.

About the Author :
Richard Lipton is the Storey Professor of Computer Science at Georgia Institute of Technology; previously he held faculty positions at Yale University, the University of California at Berkeley, and Princeton University. His research is focused primarily on the theory of computation, where he has made seminal contributions. He is a member of the National Academy of Engineering, an ACM Fellow, and a Guggenheim Fellow. Kenneth Regan is a professor of computer science at The State University of New York at Buffalo. His research interests include computational complexity. He is an international chess master and an expert on investigating cheating in chess.

Review :
“The book has 63 chapters, each one … representing an edited version of a post in GLL. … this book will appeal to readers seeking an insider view on how creative mathematical ideas emerge. And it will also appeal to experts for its insightful ruminations on current scientific and cultural problems in theoretical computer science.” (Marius Zimand, Mathematical Reviews, June, 2015) “This book is one of those inspiring books that almost every computer scientist should read. Moreover, it is also very well suited to a wider audience, including those curious about the field and newcomers. Its authors, Lipton and Regan, did a wonderful job introducing and analyzing important problems in complexity theory with an easy-to-read text. … It is therefore an invaluable source of inspiration and study.” (Carlos Linares Lopez, Computing Reviews, August, 2014)


Best Sellers


Product Details
  • ISBN-13: 9783642414213
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 333
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3642414214
  • Publisher Date: 27 Dec 2013
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Sub Title: Essays from Gödel's Lost Letter: 2010


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!