Determinacy (algorithm)

from Wikipedia, the free encyclopedia

An algorithm is determined if it always delivers the same output values ​​for the same input values ​​each time it is executed.

The concept of determinism has to be distinguished from the concept of determinism : Deterministic algorithms are always determined because they also provide the same outputs for the same inputs. However, the reverse does not apply, because different (internal) states can be passed through despite the same result .