1.Previous
3.Next

and f may take a string and return the string obtained by reversing the digits of the input (so f(0101) = 1010).Other types of problems include search problems and optimization problems.

One goal of computability theory is to determine which problems, or classes of problems, can be solved in each model of computation.

Formal models of computation

A model of computation is a formal description

1.Previous
3.Next