OUTLINE OF ALGORITHMICS

For example, for ignorable-step problems, simple control structures for sequencing
and iteration may be sufficient. However, if the problem additionally has recoverable step possibilities then facilities like back-tracking, as are available in the programming language PROLOG, may have to be used. Further, if the problem additionally has irrecoverable-step possibilities then planning tools should be available in the computer system, so that entire sequence of steps may be analyzed in advance to find out where the sequence may lead to, before the first step is actually taken.

There are many other characteristics of a problem viz.,
• Whether the problem has certain outcome or uncertain outcome
• Whether a good solution is absolute or relative
• Whether the solution is a state or a path
• Whether the problem essentially requires interaction with the user etc.
which can be known through analyzing the problem under consideration, and
the knowledge of which, in turn, may help us in determining or guessing a correct
sequence of actions for solving the problem under consideration.

Capabilities of the Computer System