Limits of Computation From a Programming Perspective /
This 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,...
| Κύριος συγγραφέας: | Reus, Bernhard (Συγγραφέας) |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
| Έκδοση: | 1st ed. 2016. |
| Σειρά: | Undergraduate Topics in Computer Science,
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Fundamentals of Parameterized Complexity
ανά: Downey, Rodney G., κ.ά.
Έκδοση: (2013) -
Language, Life, Limits 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings /
Έκδοση: (2014) -
Fundamentals of Discrete Math for Computer Science A Problem-Solving Primer /
ανά: Jenkyns, Tom, κ.ά.
Έκδοση: (2013) -
Matters Computational Ideas, Algorithms, Source Code /
ανά: Arndt, Jörg
Έκδοση: (2011) -
Computational Complexity of Solving Equation Systems
ανά: Broniek, Przemysław
Έκδοση: (2015)