Home » Limits of Computation
Product Image

Limits of Computation

Edna E. Reiter | Clayton Matthew Johnson
€117.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Clayton Matthew Johnson
A01=Edna E. Reiter
advanced undergraduate textbook
Algebraic Number
algorithmic problems
algorithmic unsolvability
Author_Clayton Matthew Johnson
Author_Edna E. Reiter
Boolean Expression
Boolean Variables
Category=PBCH
Category=PBD
Category=UB
Category=UY
Class
complexity classes
complexity of algorithmic problems
computational complexity
computational complexity theory
conjunctive
decision
Decision Problems
different sizes of infinity
difficulties of computation
Edge Eij
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
form
formal language theory
function
Hamiltonian Circuit
Innite Number
Innite Sequences
machine
Natural Numbers
nature of computation
Nite Sequence
Nondeterministic Turing Machine
normal
Np Complete Problem
Np Hard Problem
NP-complete problems
Polynomial Algorithm
POLYNOMIAL REDUCIBILITY
problem
proof techniques in computation
Re
reducibility
self-reference
Tape Alphabet
TM
transition
turing
Turing machines
Undirected Graph
universal
UTM
Vertex Cover
Vice Versa
Weighted Graph
Write Head

Product details

  • ISBN 9781439882061
  • Weight: 1300g
  • Dimensions: 156 x 234mm
  • Publication Date: 29 Oct 2012
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns
Description

Limits of Computation: An Introduction to the Undecidable and the Intractable offers a gentle introduction to the theory of computational complexity. It explains the difficulties of computation, addressing problems that have no algorithm at all and problems that cannot be solved efficiently.

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 complexity theory, the text is suitable for advanced undergraduate and beginning graduate students without a strong background in theoretical computer science. Each chapter presents the fundamentals, examples, complete proofs of theorems, and a wide range of exercises.
About Clayton Matthew Johnson | Edna E. Reiter

Edna E. Reiter, Ph.D., is the current Chair of the Department of Mathematics and Computer Science at California State University, East Bay (CSUEB). Her research interests include noncommutative ring theory and theoretical aspects of computer science.

Clayton Matthew Johnson, Ph.D., is the graduate coordinator for all M.S. students and the incoming Chair of the Department of Mathematics and Computer Science at CSUEB. His research interests include genetic algorithms and machine learning.

Drs. Reiter and Johnson developed the subject matter for the CSUEB Computation and Complexity course, which is required for all students in the computer science M.S. program. The course covers the hard problems of computer science—those that are intractable or undecidable. The material in this book has been tested on multiple sections of CSUEB students.

More from this author