| Finiteness |
|
|
|
|
|
|
|
|
|
|
|
|
|
| v | An
algorithm must eventually terminate with either |
|||||||||||
| ; | The
right output |
|||||||||||
| ; | An
indication that no solution is possible |
|||||||||||
| v | A
non-terminating algorithm is useless since it is |
|||||||||||
| impossible
to distinguish between continued progress |
||||||||||||
| and
being “stuck” |
||||||||||||
| v | Finiteness
is relevant to computer algorithms since |
|||||||||||
| they
typically repeat instructions |
||||||||||||
|
|
|
|
| 3.3 |
|||
| 3)10.0000000000… |
|||
| 9 |
|||
| 10 |
|||
| 9 |
|||
| 1 |
|||