Everything About ___
Live briefing

Everything about Deterministic algorithm

Type of algorithm in computer science

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. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Deterministic algorithmA 5-minute orientation
  2. Skim a recent paper: Deep Deterministic Policy Gradient-Based Algorithm for Computation Offloading in IoVInfluential work since 2022
  3. Pick up a classic book: Chaos, Dynamics, and FractalsThe most-reprinted book on the subject
  4. Read the landmark paper: Deterministic annealing EM algorithmCited 329 times
  5. Go sideways: Nondeterministic algorithmA closely related topic
  6. Go sideways: GLR parserA closely related topic

📖 Definitions

Noun An algorithm that when provided a specific input, will always provide the same output.

🗂️ The subject at a glance

  1. Formal definition
  2. Non-deterministic algorithms
  3. Disadvantages of determinism
  4. Determinism categories in languages

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics