Computability and Complexity Theory (Texts in Computer Science)
Our rough guess is there are 48,500 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 14 minutes to read. With a half hour per day, this will take 7 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
48,500 words, Guess
Page Count
194 pages
Identifiers
- Internet Archivecomputabilitycom00home_911
- Internet Archivecomputabilitycom00home_913
- Internet Archivecomputabilitycom00shom
- ISBN-100387950559
- ISBN-139780387950556
and 6 more
- Goodreads2927700
- LibraryThing243796
- Library of Congress Control Number00053829
- OCLC Control Number45315542
- Better World BooksP9-CGX-618
- Open LibraryOL7448693M
Classifications
- LCCQA76 .H6236 2001
Description
"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.
First Sentence
In the next chapter we will become familiar with models of computing.
Subjects
Other Editions
- Computability and Complexity Theory (Texts in Computer Science)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!