Theory of Computation Quiz

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.

Computer scientists work with a mathematical abstraction of computers called a model of computation in order to perform a rigorous study of computation.

<p>The most commonly examined model of computation is the Turing machine.</p> Signup and view all the answers

<p>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.</p> Signup and view all the answers

<p>Automata theory and formal languages, computability theory, and computational complexity theory.</p> Signup and view all the answers

<p>What are the fundamental capabilities and limitations of computers.</p> Signup and view all the answers

<p>The Turing machine.</p> Signup and view all the answers

<p>It is simple to formulate, can be analyzed and used to prove results, and represents a powerful possible model of computation.</p> Signup and view all the answers

<p>To determine what problems can be solved on a model of computation, using an algorithm, and how efficiently they can be solved or to what degree.</p> Signup and view all the answers