Deterministic Algorithm
Jump to navigation
Jump to search
A Deterministic Algorithm is a algorithm that always produces the same algorithm output for a given algorithm input.
- …
- Counter-Example(s):
- See: Deterministic, Algorithm, Deterministic Running-Time Algorithm, Function Domain.
References
2016
- (Wikipedia, 2016) ⇒ http://wikipedia.org/wiki/deterministic_algorithm Retrieved:2016-1-28.
- 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.
Formally, a deterministic algorithm computes a mathematical function; a function has a unique value for any input in its domain, and the algorithm is a process that produces this particular value as output.
- 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.