Jump to content

Deterministic computation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Canderra (talk | contribs) at 16:39, 2 February 2006 (Determinism depends on the input.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In Computer Science a Deterministic Computation is a computation that given an initial state of the system will always produce the same final state when given the same input.