Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | People, Problems, and Proofs - Essays from Gödel's Lost Letter: 2010

People, Problems, and Proofs

Essays from Gödel's Lost Letter: 2010

Lipton, Richard J., Regan, Kenneth W.

2013, XVIII, 333 p. 33 illus., 5 illus. in color.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$29.99

(net) price for USA

ISBN 978-3-642-41422-0

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$39.99

(net) price for USA

ISBN 978-3-642-41421-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Unique breadth of examples from the history of computer science and mathematics
  • Offers tips and inspiration to graduate students
  • Authors very experienced at communicating the essence of difficult problems

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 characterized 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.

Content Level » Research

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

Related subjects » General Issues - History of Mathematical Sciences - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.