Limits of Computation: An Introduction to the Undecidable and the Intractable
| Author | : | |
| Rating | : | 4.42 (698 Votes) |
| Asin | : | 1439882061 |
| Format Type | : | paperback |
| Number of Pages | : | 279 Pages |
| Publish Date | : | 2013-02-21 |
| Language | : | English |
DESCRIPTION:
Drs. The material in this book has been tested on multiple sections of CSUEB students.. His research interests include genetic algorithms and machine learning. students and the incoming Chair of the Department of Mathematics and Computer Science at CSUEB. The course covers the hard problems of computer sciencethose that are intractable or undecidable. Reiter, Ph.D., is the current Chair of the Department of Mathematics and Computer Science at California State University, East Bay
Limits of Computation: An Introduction to the Undecidable and the Intractable offers a gentle introduction to the theory of computational complexity. The book enables readers to understand:What does it mean for a problem to be unsolvable or to be NP-complete?What is meant by a computation and what is a general model of a computer?What does it mean for an algorithm to exist and what kinds of problems have no algorithm?What problems have algorithms but the algorithm may take centuries to finish? Developed from the authors’ course on computational comp
"… a very basic, reader friendly introduction to computational complexity theory. It could be used as a textbook for graduate-level and doctoral courses on DSNs, and would also serve as a reference for engineers, scientists, and researchers working in this field."Computing Reviews, April 2013. … Because the book is so readable, it is likely that its primary audience will include students who experienced difficulties with other books on the topic. What sets their book apart from others on the topic is its leisurely pace. However, those students would probably benefit from more exe
so that was fantastic. Brand new, just as described. It came about 2 weeks earlier than it was supposed to, so that was fantastic.