Jump to content

Deterministic computation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Matthew0028 (talk | contribs) at 23:32, 25 January 2006 (Added stub marker). 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.