|
|
|
|
|
|
|
|
|
|
|
|
|
v |
An
algorithm must be explicit about how to realize the
|
|
computation
|
|
|
v |
Definiteness
is achieved by giving commands that
|
|
|
state
unambiguously what to do, in sequence
|
|
|
v |
The
commands may be …
|
|
|
|
o |
Conditional,
i.e. require a decision to be made, and so must
|
|
|
be
explicit about how to respond to all different outcomes
|
|
|
|
o |
Repeated,
and so must be explicit about when to stop the
|
|
|
repetition
|
|