Computability and Complexity Theory (Texts in Computer Science) - Info and Reading Options

The Open Library:

"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.

Search for “Computability and Complexity Theory (Texts in Computer Science)” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "Computability and Complexity Theory (Texts in Computer Science)" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: full
• Check if available: The Open Library & The Internet Archive

Find “Computability and Complexity Theory (Texts in Computer Science)” in Libraries Near You:

Read or borrow “Computability and Complexity Theory (Texts in Computer Science)” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Computability and Complexity Theory (Texts in Computer Science)” at a library near you.