About this book
This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative.
Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included.
"Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.
- Book Title Limits of Computation
- Book Subtitle From a Programming Perspective
- Series Title Undergraduate Topics in Computer Science
- Series Abbreviated Title Undergraduate Topics Computer Sci.
- DOI https://doi.org/10.1007/978-3-319-27889-6
- Copyright Information Springer International Publishing Switzerland 2016
- Publisher Name Springer, Cham
- eBook Packages Computer Science Computer Science (R0)
- Softcover ISBN 978-3-319-27887-2
- eBook ISBN 978-3-319-27889-6
- Series ISSN 1863-7310
- Series E-ISSN 2197-1781
- Edition Number 1
- Number of Pages XVIII, 348
- Number of Illustrations 80 b/w illustrations, 0 illustrations in colour
Algorithm Analysis and Problem Complexity
Mathematics of Algorithmic Complexity
- Buy this book on publisher's site
“This is a textbook about computability and complexity delivered as a one-semester final year module for undergraduates. ... There are quite a few exercises and dozens of important references at the end of each chapter, as well as a lot of interesting historical footnotes throughout. ... book may serve not only as an undergraduate text, but also as a reference source.” (Haim Kilov, zbMATH 1376.68003, 2018)
“I think this is a very good update of Neil Jones’s brilliant approach at teaching computability and complexity in a nontraditional manner that may resonate with students who are not necessarily deeply interested in mathematical abstractions. … I think Reus’s book deserves a large readership and should be tried out as an alternative text … in computing and communications courses worldwide.” (Sitabhra Sinha, Computing Reviews, January, 2017)