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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
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#
wikipedia-enhttp://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/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Full_cycle
rdf:type
yago:PhysicalEntity100001930 yago:Apparatus102727825 yago:Equipment103294048 yago:Instrumentality103575240 yago:Artifact100021939 yago:Whole100003553 yago:WikicatPseudorandomNumberGenerators yago:Object100002684 yago:Generator103434188
rdfs:label
Full cycle
rdfs:comment
In a pseudorandom number generator (PRNG), a full cycle or full period is the behavior of a PRNG over its set of valid states. In particular, a PRNG is said to have a full cycle if, for any valid seed state, the PRNG traverses every valid state before returning to the seed state, i.e., the period is equal to the cardinality of the state space.
dcterms:subject
dbc:Pseudorandom_number_generators dbc:Articles_with_example_Python_(programming_language)_code
dbo:wikiPageID
2145989
dbo:wikiPageRevisionID
1089455404
dbo:wikiPageWikiLink
dbc:Articles_with_example_Python_(programming_language)_code dbr:Linear-feedback_shift_register dbr:Random_seed dbc:Pseudorandom_number_generators dbr:Pseudorandom_number_generator dbr:Linear_congruential_generator dbr:Xorshift dbr:Coprime_integers
owl:sameAs
freebase:m.06q4qz wikidata:Q5508175 n17:4k2ap yago-res:Full_cycle
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Unreferenced
dbp:bot
noref
dbp:date
June 2019
dbo:abstract
In a pseudorandom number generator (PRNG), a full cycle or full period is the behavior of a PRNG over its set of valid states. In particular, a PRNG is said to have a full cycle if, for any valid seed state, the PRNG traverses every valid state before returning to the seed state, i.e., the period is equal to the cardinality of the state space. The restrictions on the parameters of a PRNG for it to possess a full cycle are known only for certain types of PRNGs, such as linear congruential generators and linear-feedback shift registers. There is no general method to determine whether a PRNG algorithm is full-cycle short of exhausting the state space, which may be exponentially large compared to the size of the algorithm's internal state.
gold:hypernym
dbr:Term
prov:wasDerivedFrom
wikipedia-en:Full_cycle?oldid=1089455404&ns=0
dbo:wikiPageLength
2290
foaf:isPrimaryTopicOf
wikipedia-en:Full_cycle