My Account Log in

1 option

Limits of Computation : From a Programming Perspective / by Bernhard Reus.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Author/Creator:
Reus, Bernhard, 1965- author.
Contributor:
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Undergraduate topics in computer science 1863-7310
Undergraduate Topics in Computer Science, 1863-7310
Language:
English
Subjects (All):
Algorithms.
Algorithm Analysis and Problem Complexity.
Mathematics of Algorithmic Complexity.
Local Subjects:
Algorithm Analysis and Problem Complexity.
Mathematics of Algorithmic Complexity.
Physical Description:
1 online resource (XVIII, 348 pages) : 80 illustrations.
Edition:
First edition 2016.
Contained In:
Springer eBooks
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2016.
System Details:
text file PDF
Summary:
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.
Other Format:
Printed edition:
ISBN:
978-3-319-27889-6
9783319278896
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account