\begin{definition}[Definition:Computational Method/Computational Sequence]
Consider the '''computational method''' $\left({Q, I, \Omega, f}\right)$ in which:
: $Q$ represents the set of '''states of the computation'''
: $I$ represents the '''input to the computation'''
: $\Omega$ represents the '''output from the computation'''
: $f: Q \to Q$ represents the '''computational rule'''
Each $x \in I$ defines a '''computational sequence''' $x_0, x_1, x_2, \ldots$ as follows:
: $x_0 = x$
: $\forall k \ge 0: x_{k+1} = f \left({x_k}\right)$
\end{definition}