Definition
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.
Related concepts
Abstract machineAlgorithmBlackjackComputer scienceCryptographically secure pseudo-random number generatorDeadlock (computer science)Deterministic Turing machineDeterministic finite automatonFunction (mathematics)Function domainFunctional programmingGary McGrawGlobal variableHardware random number generatorHaskellIBMIdempotencyJava (programming language)John ViegaMercury (programming language)Monad (functional programming)Multi-core processorNP (complexity)OCamlP=NP problemProgramming languagePseudorandom number generatorRace conditionRandom seedRandomized algorithmRandomnessScala (programming language)Standard MLState machineUSENIX
5 concepts already in your glossary