| 000 | 02761nam a22003855i 4500 | ||
|---|---|---|---|
| 001 | 85382 | ||
| 003 | ES-MaUEC | ||
| 005 | 20230207040508.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 160325s2016 gw | s |||| 0|eng d | ||
| 020 | _a9783319278896 | ||
| 040 | _aES-MaUEC | ||
| 050 | 4 |
_aQA76.6 _bR487 2016 |
|
| 082 | 0 | 4 | _a005.1 |
| 100 | 1 |
_aReus, Bernhard. _998301 _0Local |
|
| 245 | 1 | 0 |
_aLimits of Computation : _bFrom a Programming Perspective _cby Bernhard Reus |
| 250 | _a1st ed. | ||
| 260 |
_aCham _bSpringer International Publishing _c2016 |
||
| 300 |
_a1 recurso en línea (XVIII, 348 páginas) _b80 ilustraciones |
||
| 336 |
_aTexto _btxt _2rdacontent |
||
| 337 |
_aelectrónico _bc _2rdamedia |
||
| 338 |
_arecurso electrónico _bcr _2rdacarrier |
||
| 490 | 0 |
_aUndergraduate Topics in Computer Science _x1863-7310 |
|
| 520 | 3 | _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. | |
| 710 | 2 |
_aSpringerLink (Online service) _0Local _9106996 |
|
| 942 |
_2lcc _cLE |
||
| 988 | _aEBOOK, asignarmaterias , EBSPRINGER | ||
| 650 | 0 | 7 |
_aAlgoritmos _0 _2embne _9141162 |
| 650 | 7 |
_aProgramación de ordenadores _0(OCoLC)872390 _2embne _0 _9139821 |
|
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://link.springer.com/book/10.1007/978-3-319-27889-6 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 901 | _ai9783319278896 | ||
| 907 |
_a.b12946606 _b10-10-17 _c21-11-16 |
||
| 998 |
_am _a_alco _a_vill _b - - _cm _dz _e- _feng _ggw _h0 |
||
| 945 |
_aQA76.6 R487 2016 EB _g1 _ieBOOK _j0 _lmae _o- _pEUR0.00 _q- _r- _sb _t15 _u0 _v0 _w0 _x0 _y.i11590348 _z06-04-17 |
||
| 999 |
_c85382 _d85382 _x1 |
||