Deterministic algorithm

An algorithm that follows fixed rules and makes no random choices, producing the same output for the same input under the same conditions.

Algorithm: A finite, precise procedure for solving a problem or performing a computation. Deterministic algorithms are a major class of algorithms, distinguished by fixed choices at each step.
Turing machine: An abstract model of computation that manipulates symbols on a tape according to formal rules. A deterministic Turing machine has one prescribed transition for each applicable state and symbol.
Nondeterministic algorithm: A computational model that may allow multiple possible next steps from a configuration. It contrasts with deterministic execution, where each configuration fixes the next step.
Reproducible research: Research practices that make analyses and results independently repeatable from shared methods and materials. Fixed algorithms help reproduce computational results from the same data and conditions.
Program state: The information a computation retains at a particular point in its execution. Given the same state and input, deterministic steps select the same next state.
Computable function: A function whose values can be produced by a finite effective procedure. A deterministic algorithm computes a function when its runs return the function’s values.
Las Vegas algorithm: A randomized algorithm that always returns a correct answer but has random running time. Its random choices affect how long a run takes, unlike fixed deterministic execution.
Formal verification: The use of mathematical methods to prove that software satisfies specified properties. Deterministic behavior can make program execution easier to reason about and verify.
Control flow: The order in which instructions or operations execute in a program. Fixed branching rules determine which instruction follows each step.
Input–output model: A description of computation in terms of supplied inputs and resulting outputs. Determinism specifies how each fixed input maps to an output.

Linked from 11 pages