This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n10http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Deterministic_algorithm
rdf:type
dbo:Software
rdfs:label
Deterministic algorithm
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.
owl:sameAs
yago-res:Deterministic_algorithm freebase:m.031341
dbp:wikiPageUsesTemplate
dbt:Short_description
dct:subject
dbc:Analysis_of_algorithms
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
n10:Deterministic_algorithm?oldid=1069096015&ns=0
dbo:wikiPageID
665951
dbo:wikiPageLength
8885
dbo:wikiPageRevisionID
1069096015
dbo:wikiPageWikiLink
dbr:Pseudorandom_number_generator dbr:Blackjack dbr:Function_(mathematics) dbr:Abstract_machine dbr:Java_(programming_language) dbr:ML_(programming_language) dbr:Programming_language dbr:Hardware_random_number_generator dbc:Analysis_of_algorithms dbr:Domain_of_a_function dbr:Computer_science dbr:Algorithm dbr:Standard_ML dbr:Deterministic_finite_automaton dbr:Randomized_algorithm dbr:Haskell_(programming_language) dbr:Cryptographically-secure_pseudorandom_number_generator dbr:Mercury_(programming_language) dbr:Turing_machine dbr:Multi-core_processor dbr:Deadlock dbr:Race_condition dbr:Global_variable dbr:Randomness dbr:Random_seed dbr:Monad_(functional_programming) dbr:Finite-state_machine dbr:Scala_(programming_language) dbr:Functional_programming dbr:P_versus_NP_problem dbr:OCaml dbr:NP_(complexity)
dbo: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.
foaf:isPrimaryTopicOf
n10:Deterministic_algorithm