A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.

In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?" (Source: Wikipedia)   The 'theory of computation' is important... Show more

In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones).

The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?"

(Source: Wikipedia)
 

The 'theory of computation' is important in computing because it forms the basis for:
1. Writing efficient algorithms that run in computing devices.
2. Programming language research and their development.
3. Efficient compiler design and construction
 

Show less