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,...
Main Author: | Reus, Bernhard (Author) |
---|---|
Corporate Author: | SpringerLink (Online service) |
Format: | Electronic eBook |
Language: | English |
Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
Edition: | 1st ed. 2016. |
Series: | Undergraduate Topics in Computer Science,
|
Subjects: | |
Online Access: | Full Text via HEAL-Link |
Similar Items
-
Fundamentals of Parameterized Complexity
by: Downey, Rodney G., et al.
Published: (2013) -
Language, Life, Limits 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings /
Published: (2014) -
Fundamentals of Discrete Math for Computer Science A Problem-Solving Primer /
by: Jenkyns, Tom, et al.
Published: (2013) -
Matters Computational Ideas, Algorithms, Source Code /
by: Arndt, Jörg
Published: (2011) -
Computational Complexity of Solving Equation Systems
by: Broniek, Przemysław
Published: (2015)