People, Problems, and Proofs

Essays from Gödel's Lost Letter: 2010

  • Richard J. Lipton
  • Kenneth W. Regan

Table of contents

  1. Front Matter
    Pages I-XVIII
  2. Richard J. Lipton, Kenneth W. Regan
    Pages 1-18
  3. Richard J. Lipton, Kenneth W. Regan
    Pages 19-23
  4. Richard J. Lipton, Kenneth W. Regan
    Pages 25-28
  5. Richard J. Lipton, Kenneth W. Regan
    Pages 29-34
  6. Richard J. Lipton, Kenneth W. Regan
    Pages 35-37
  7. Richard J. Lipton, Kenneth W. Regan
    Pages 39-43
  8. Richard J. Lipton, Kenneth W. Regan
    Pages 45-50
  9. Richard J. Lipton, Kenneth W. Regan
    Pages 51-55
  10. Richard J. Lipton, Kenneth W. Regan
    Pages 57-59
  11. Richard J. Lipton, Kenneth W. Regan
    Pages 61-64
  12. Richard J. Lipton, Kenneth W. Regan
    Pages 65-69
  13. Richard J. Lipton, Kenneth W. Regan
    Pages 71-74
  14. Richard J. Lipton, Kenneth W. Regan
    Pages 75-78
  15. Richard J. Lipton, Kenneth W. Regan
    Pages 79-82
  16. Richard J. Lipton, Kenneth W. Regan
    Pages 83-86
  17. Richard J. Lipton, Kenneth W. Regan
    Pages 87-91
  18. Richard J. Lipton, Kenneth W. Regan
    Pages 93-97
  19. Richard J. Lipton, Kenneth W. Regan
    Pages 99-103
  20. Richard J. Lipton, Kenneth W. Regan
    Pages 105-108

About this book

Introduction

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.

Keywords

Algorithms Chess Complexity theory Computational complexity Computer science teaching Cryptology Graduate studies in computer science History of computing Mathematical logic Mathematics of computer science Open problems in computer science Quantum computing Theoretical computer science

Authors and affiliations

  • Richard J. Lipton
    • 1
  • Kenneth W. Regan
    • 2
  1. 1.College of Computing School of Computer ScienceGeorgia Institute of TechnologyAtlantaUSA
  2. 2.Dept. of Computer Sci. & EngineeringThe State University of New YorkBuffaloUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-41422-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-41421-3
  • Online ISBN 978-3-642-41422-0
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology