Definition:Computational Method/Computational Sequence/Termination
Jump to navigation
Jump to search
Definition
A computational sequence $x_0, x_1, x_2, \ldots$ is said to terminate in $k$ steps if $k$ is the smallest integer for which $x_k \in \Omega$.
In this case, it produces the output $x_k$ from $x$.
Some computational sequences may never terminate.
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.1$: Algorithms