Computation Theory is the study of the fundamental principles underly-ing computation and the analysis of algorithms. It’s often split into three parts: automata, computability, and complexity.

The Theory of Computation is the study of the formal foundations of computer science and technology. This dynamic and rapidly expanding eld straddles mathematics and computer science.

In 1936, Alan Turing, one of the fathers of modern computer science, de-veloped the Turing Machine, a theoretical model of computation which is widely believed to be just as powerful as all programming …

The definition of computation as an execution sequence of a computing machine under the direction of an algorithm that halts is clearly too limited. We need to rethink computation to encompass not only …

The purpose of these notes is to introduce some of the basic notions of the theory of computation, including concepts from formal languages and automata theory, the theory of computability, some …

The notions of input and output are the most basic concepts of computation: computation is – for the moment – the process of deriving the desired output from a given input(s).

ELEMENTS OF THE THEORY OF COMPUTATION Harry R. Lewis, and Christos H. Papadimitriou Prentice Hall, 2nd Edition