In the case of a single equation, the "solver" is more appropriately called a root-finding algorithm.

An anytime algorithm may be also called an "interruptible algorithm".

This is why it is called an interruptible algorithm.

The mathematical formula for encoding a message - which determines how the key is used - is called an algorithm.

Then, the computer attempts to make a match of minutiae points by following a set of instructions called a searching algorithm.

What is needed is a transformation - usually called an algorithm - that can be carried out on a key to yield a storage address.

The overall set of computations for a dynamic problem is called a dynamic algorithm.

A running time of .00001 seconds is reasonable, and that's why this is called a practical algorithm.

Such a technique, or its result, is called a genetic algorithm.

Logic is used by computers in what is called an algorithm.