Matches in DBpedia 2014 for { <http://dbpedia.org/resource/ELEMENTARY> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- ELEMENTARY abstract "In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes in the exponential hierarchy. The name was coined by László Kalmár, in the context of recursive functions and undecidability; most problems in it are far from elementary. Some natural recursive problems lie outside ELEMENTARY, and are thus NONELEMENTARY. Most notably, there are primitive recursive problems that are not in ELEMENTARY. We knowLOWER-ELEMENTARY EXPTIME ELEMENTARY PR RWhereas ELEMENTARY contains bounded applications of exponentiation (for example, ), PR allows more general hyper operators (for example, tetration) which are not contained in ELEMENTARY.".
- ELEMENTARY wikiPageID "665096".
- ELEMENTARY wikiPageRevisionID "581639784".
- ELEMENTARY hasPhotoCollection ELEMENTARY.
- ELEMENTARY subject Category:Complexity_classes.
- ELEMENTARY subject Category:Computability_theory.
- ELEMENTARY type Abstraction100002137.
- ELEMENTARY type Class107997703.
- ELEMENTARY type Collection107951464.
- ELEMENTARY type ComplexityClasses.
- ELEMENTARY type Group100031264.
- ELEMENTARY comment "In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes in the exponential hierarchy. The name was coined by László Kalmár, in the context of recursive functions and undecidability; most problems in it are far from elementary. Some natural recursive problems lie outside ELEMENTARY, and are thus NONELEMENTARY. Most notably, there are primitive recursive problems that are not in ELEMENTARY.".
- ELEMENTARY label "ELEMENTARY".
- ELEMENTARY label "ELEMENTARY".
- ELEMENTARY sameAs m.03101r.
- ELEMENTARY sameAs Q5323278.
- ELEMENTARY sameAs Q5323278.
- ELEMENTARY sameAs ELEMENTARY.
- ELEMENTARY wasDerivedFrom ELEMENTARY?oldid=581639784.
- ELEMENTARY isPrimaryTopicOf ELEMENTARY.