About: Deterministic algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Deterministic algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdf:type	software
rdfs:label	Deterministic algorithm (en)
rdfs:comment	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. (en)
sameAs	Deterministic algorithm Deterministic algorithm
dbp:wikiPageUsesTemplate	dbt:Short_description
Subject	Analysis of algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Deterministic_algorithm?oldid=1069096015&ns=0
Wikipage page ID	665951 (xsd:integer)
page length (characters) of wiki page	8885 (xsd:nonNegativeInteger)
Wikipage revision ID	1069096015 (xsd:integer)
Link from a Wikipage to another Wikipage	NP-completeness OCaml Programming language Abstract machine Algorithm Blackjack Turing machine Analysis of algorithms Global variable Domain of a function Java (programming language) P versus NP problem Cryptographically-secure pseudorandom number generator Deadlock Pseudorandom number generator Computer science Finite-state machine Function (mathematics) Functional programming Scala (programming language) Deterministic finite automaton Hardware random number generator Haskell (programming language) Monad (functional programming) Standard ML Mercury (programming language) ML (programming language) Multi-core processor Race condition Random seed Randomized algorithm Randomness
has abstract	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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Deterministic_algorithm
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures NP-completeness Nagel–Schreckenberg model No Man's Sky Nondeterministic algorithm Npm (software) AKS primality test Aanderaa–Karp–Rosenberg conjecture Acoustic fingerprint Adleman–Pomerance–Rumely primality test Algorithm Algorithm characterizations Amidar Asymptotic computational complexity Bayesian network Bentley–Ottmann algorithm Bias–variance tradeoff Block cipher Boolean satisfiability algorithm heuristics Monte Carlo algorithm Monte Carlo integration Monte Carlo method CPU time Freivalds' algorithm Friction of distance Gibbs sampling Glossary of artificial intelligence Kahn process networks Door Door Majority problem (cellular automaton) Method of conditional probabilities Nano-RK Oblivious RAM Circular layout Cryptographic hash function Dehn function Hypercube internetwork topology Linear seismic inversion List of Indian inventions and discoveries Cluster analysis Algorithmic complexity Computer simulation Consensus (computer science) Convex volume approximation Convolutional neural network Cornelis H. A. Koster Cost distance analysis Highway Capacity Software Miller–Rabin primality test Eric Hehner Error detection and correction Game tree Graph coloring Incompressibility method

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software