Overview
- 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
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (63 chapters)
Keywords
About this 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.Reviews
“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)Authors and Affiliations
About the authors
Bibliographic Information
Book Title: People, Problems, and Proofs
Book Subtitle: Essays from Gödel's Lost Letter: 2010
Authors: Richard J. Lipton, Kenneth W. Regan
DOI: https://doi.org/10.1007/978-3-642-41422-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2013
Hardcover ISBN: 978-3-642-41421-3Published: 27 December 2013
Softcover ISBN: 978-3-662-52301-8Published: 23 August 2016
eBook ISBN: 978-3-642-41422-0Published: 11 December 2013
Edition Number: 1
Number of Pages: XVIII, 333
Number of Illustrations: 28 b/w illustrations, 5 illustrations in colour
Topics: Theory of Computation, History of Computing, Mathematics of Computing, History of Mathematical Sciences
Industry Sectors: Aerospace, Consumer Packaged Goods, Electronics, Energy, Utilities & Environment, Engineering, Finance, Business & Banking, IT & Software, Law, Materials & Steel, Oil, Gas & Geosciences, Pharma, Telecommunications