| 000 | 02766nam a22004575i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-27889-6 | ||
| 003 | DE-He213 | ||
| 005 | 20200421112047.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 160325s2016 gw | s |||| 0|eng d | ||
| 020 |
_a9783319278896 _9978-3-319-27889-6 |
||
| 024 | 7 |
_a10.1007/978-3-319-27889-6 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 100 | 1 |
_aReus, Bernhard. _eauthor. |
|
| 245 | 1 | 0 |
_aLimits of Computation _h[electronic resource] : _bFrom a Programming Perspective / _cby Bernhard Reus. |
| 250 | _a1st ed. 2016. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2016. |
|
| 300 |
_aXVIII, 348 p. 80 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aUndergraduate Topics in Computer Science, _x1863-7310 |
|
| 520 | _aThis 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. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aMathematics of Algorithmic Complexity. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319278872 |
| 830 | 0 |
_aUndergraduate Topics in Computer Science, _x1863-7310 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-27889-6 |
| 912 | _aZDB-2-SCS | ||
| 942 | _cEBK | ||
| 999 |
_c57001 _d57001 |
||