plete state of the execution of the

algorithm at each step and the current state is ever identical to some previous state then the algorithm is in a loop. This might require an arbitrary amount of storage however. Alternatively, if there are at most N possible different states then the algorithm can run for at most N steps without looping.

A program analysis called termination analysis attempts to answer this question for limited kinds of input algorithm.

Last updated: 1994-10-20

Nearby terms:

plete state of the execution of the if there are at most N possible different

Try this search on Wikipedia, OneLook, Google


Loading