In
theoretical computer science, the theory of computation is the branch that
deals with whether and how efficiently problems can be solved on a model of
computation, using analgorithm. The field is divided into three major branches:
automata theory, computability theory and computational complexity theory.
In order to
perform a rigorous study of computation, computer scientists work with a
mathematical abstraction of computers called a model of computation. There are
several models in use, but the most commonly examined is the Turing machine.
Computer scientists study the Turing machine because it is simple to formulate,
can be analyzed and used to prove results, and because it represents what many
consider the most powerful possible "reasonable" model of
computation. It might seem that the potentially infinite memory capacity is an
unrealizable attribute, but any decidable problem solved by a Turing machine
will always require only a finite amount of memory. So in principle, any
problem that can be solved (decided) by a Turing machine can be solved by a
computer that has a bounded amount of memory.
for solving all these problem related to toc
this is a book for all of you....
this is a book for all of you....
Introduction to the Theory of Computation by Michael Sipser.
Thanks for this book
ReplyDelete