Gå direkte til innholdet
Limits of Computation
Spar

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.
Undertittel
From a Programming Perspective
Forfatter
Bernhard Reus
Opplag
1st ed. 2016
ISBN
9783319278872
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
4.4.2016
Antall sider
348