Determinism

From Computer Science Wiki
Revision as of 21:34, 8 March 2020 by Mr. MacKenty (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Programming[1]

Simply put, the same operation performed across different nodes should return the same result. ... Determinism also refers to the fact that the same operation replayed on a different node at a different point in time should also produce the same results.[2]

In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states. Deterministic algorithms are by far the most studied and familiar kind of algorithm, as well as one of the most practical, since they can be run on real machines efficiently.[3]


References