Main image
Click to view image in fullscreen
![]()
Limits of Computation
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.
640,00 DH
En stock
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.
| ISBN / EAN | 9783319278872 |
|---|---|
| Auteur | Reus, Bernhard |
| Editeur | Springer International Publishing AG |