Definiteness
An algorithm must be explicit about how to realize the computation
Definiteness is achieved by giving commands that state unambiguously what to do, in sequence
The commands may be …
- Conditional, i.e. require a decision to be made, and so must be explicit about how to respond to all different outcomes
- Repeated, and so must be explicit about when to stop the repetition
The definiteness property assures that the executing agent will always know what command to perform next