Definition:Computational Method

Definition
A computational method is an ordered quadruple $\left({Q, I, \Omega, f}\right)$ in which:
 * $Q$ is a set representing the states of the computation
 * $I$ is a set representing the input to the computation
 * $\Omega$ is a set representing the output from the computation
 * $f: Q \to Q$ is a mapping representing the computational rule

subject to the following constraints:
 * $I \subseteq Q$ and $\Omega \subseteq Q$
 * $\forall x \in \Omega: f \left({x}\right) = x$

Also see

 * Definition:Algorithm: a computational method which terminates in finitely many steps for all $x \in I$.

Historical Note
This definition is very nearly the same as that given by in his Theory of Algorithms (1954).