Limits of Computation (Record no. 57001)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02766nam a22004575i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-27889-6 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421112047.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 160325s2016 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319278896 |
| -- | 978-3-319-27889-6 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.1 |
| 100 1# - AUTHOR NAME | |
| Author | Reus, Bernhard. |
| 245 10 - TITLE STATEMENT | |
| Title | Limits of Computation |
| Sub Title | From a Programming Perspective / |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2016. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XVIII, 348 p. 80 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Undergraduate Topics in Computer Science, |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-27889-6 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2016. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematics of Algorithmic Complexity. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 1863-7310 |
| 912 ## - | |
| -- | ZDB-2-SCS |
No items available.