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.
- Comment
- enIn 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.
- Has abstract
- enIn 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.
- Hypernym
- Algorithm
- Is primary topic of
- Deterministic algorithm
- Label
- enDeterministic algorithm
- Link from a Wikipage to another Wikipage
- Abstract machine
- Algorithm
- Blackjack
- Category:Analysis of algorithms
- Computer science
- Cryptographically secure pseudo-random number generator
- Deadlock
- Deterministic finite automaton
- Deterministic Turing machine
- Function (mathematics)
- Functional programming
- Function domain
- Global variable
- Hardware random number generator
- Haskell
- Java (programming language)
- Mercury (programming language)
- Monad (functional programming)
- Multi-core processor
- NP (complexity)
- OCaml
- P=NP problem
- Programming language
- Pseudorandom number generator
- Race condition
- Randomized algorithm
- Randomness
- Random seed
- Scala (programming language)
- Standard ML
- State Machine
- SameAs
- 9Zws
- Algorithme déterministe
- Algoritmo determinista
- Algoritmo determinístico
- Algorytm deterministyczny
- Determinismus (Algorithmus)
- Deterministic algorithm
- Deterministic algorithm
- Deterministický algoritmus
- Deterministisk algoritm
- m.031341
- Q1064349
- Thuật toán tất định
- Детерминиран алгоритъм
- Детерминированный алгоритм
- Детерминистички алгоритам
- Детермінований алгоритм
- אלגוריתם דטרמיניסטי
- الگوریتم قطعی
- خوارزمية حتمية
- 決定的アルゴリズム
- 确定性算法
- 결정론적 알고리즘
- Subject
- Category:Analysis of algorithms
- WasDerivedFrom
- Deterministic algorithm?oldid=1094197951&ns=0
- WikiPageLength
- 8830
- Wikipage page ID
- 665951
- Wikipage revision ID
- 1094197951
- WikiPageUsesTemplate
- Template:Short description