Linked from

The 11 pages that link to Deterministic algorithm, each with the reason it gives.

• Monte Carlo methodCompared with: Monte Carlo algorithms deliberately use random choices, unlike deterministic procedures.

• Randomized algorithmCompared with: Unlike randomized algorithms, it follows the same execution path for a given input.

• Primality testCompared with: Deterministic primality tests guarantee the answer, unlike randomized probable-prime tests.

• Random number generationCompared with: A deterministic generator cannot create unpredictability from nothing; it expands an initial state into a sequence.

• Pseudorandom number generatorNarrower topic: A pseudorandom generator is deterministic even when its output is designed to resemble random data.

• Polynomial timeRelated: Polynomial time usually bounds the steps of deterministic algorithms when defining P.

• Random number generatorCompared with: A pseudorandom generator is deterministic internally, even when its outputs appear random.

• Game loopRelated: Deterministic updates support reproducible gameplay and synchronized multiplayer simulation.

• Deterministic systemBroader topic: It applies unique rule-governed evolution to computational states.

• Gibbard–Satterthwaite theoremCompared with: Randomized voting rules are outside the theorem's deterministic scope.

• State (computing)Compared with: Determinism makes state evolution reproducible under fixed conditions.