Gå direkt till innehållet
Limits of Computation
Spara

Limits of Computation

Lägsta pris på PriceRunner
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.
Undertitel
From a Programming Perspective
Författare
Bernhard Reus
Upplaga
1st ed. 2016
ISBN
9783319278872
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
2016-04-04
Sidor
348