
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations and about the efficiency of the computations that use these resources. In addition, it provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other problems. Requiring no explicit prerequisite knowledge, Computability and Complexity Theory introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability NP-completeness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable.--BOOK JACKET.
The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations and about the efficiency of the computations that use these resources. The book introduces core knowledge in the theory of computation, moving from classical computability theory to complexity theory. It is self-contained, with a preliminary chapter on mathematical concepts and notations. Dedicated chapters cover undecidability, NP-completeness, and relative computability, focusing on the limitations of computation and the distinctions between feasible and intractable problems.
This book is presented as a self-contained introduction to the core materials in the theory of computation, requiring no explicit prerequisite knowledge. It progresses from qualitative aspects of computability to quantitative aspects of complexity. The structure includes dedicated chapters on key topics such as undecidability and NP-completeness, aiming to elucidate the limitations of computation and the boundaries between feasible and intractable problems. The approach focuses on providing foundational concepts and formalisms for understanding computational resources and efficiency.
Page Count:
194
Publication Date:
2001-01-01
ISBN-10:
0387950559
ISBN-13:
9780387950556
No comments yet. Be the first to share your thoughts!