go-v.orgcodex
Menu
Page tools

codex · Philosophy

Deterministic algorithm

In computer science, a deterministic algorithm is an algorithm that, 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.

Wikipedia contributors, "Deterministic algorithm", Wikipedia, revision 1375967411, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex