Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Hardy_hierarchy> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Hardy_hierarchy abstract "In computability theory, computational complexity theory and proof theory, the Hardy hierarchy, named after G. H. Hardy, is an ordinal-indexed family of functions hα: N → N (where N is the set of natural numbers, {0, 1, ...}). It is related to the fast-growing hierarchy and slow-growing hierarchy. The hierarchy was first described in Hardy's 1904 paper, \"A theorem concerning the infinite cardinal numbers\".".
- Hardy_hierarchy wikiPageExternalLink goodstein.pdf.
- Hardy_hierarchy wikiPageID "25264191".
- Hardy_hierarchy wikiPageLength "3261".
- Hardy_hierarchy wikiPageOutDegree "15".
- Hardy_hierarchy wikiPageRevisionID "697558315".
- Hardy_hierarchy wikiPageWikiLink Category:Computability_theory.
- Hardy_hierarchy wikiPageWikiLink Category:Hierarchy_of_functions.
- Hardy_hierarchy wikiPageWikiLink Category:Proof_theory.
- Hardy_hierarchy wikiPageWikiLink Computability_theory.
- Hardy_hierarchy wikiPageWikiLink Computational_complexity_theory.
- Hardy_hierarchy wikiPageWikiLink Fast-growing_hierarchy.
- Hardy_hierarchy wikiPageWikiLink G._H._Hardy.
- Hardy_hierarchy wikiPageWikiLink Large_countable_ordinal.
- Hardy_hierarchy wikiPageWikiLink Limit_ordinal.
- Hardy_hierarchy wikiPageWikiLink Natural_number.
- Hardy_hierarchy wikiPageWikiLink Proof_theory.
- Hardy_hierarchy wikiPageWikiLink Slow-growing_hierarchy.
- Hardy_hierarchy wikiPageWikiLink Veblen_function.
- Hardy_hierarchy wikiPageWikiLinkText "Hardy hierarchy".
- Hardy_hierarchy wikiPageUsesTemplate Template:Citation.
- Hardy_hierarchy subject Category:Computability_theory.
- Hardy_hierarchy subject Category:Hierarchy_of_functions.
- Hardy_hierarchy subject Category:Proof_theory.
- Hardy_hierarchy hypernym Family.
- Hardy_hierarchy type Proof.
- Hardy_hierarchy comment "In computability theory, computational complexity theory and proof theory, the Hardy hierarchy, named after G. H. Hardy, is an ordinal-indexed family of functions hα: N → N (where N is the set of natural numbers, {0, 1, ...}). It is related to the fast-growing hierarchy and slow-growing hierarchy. The hierarchy was first described in Hardy's 1904 paper, \"A theorem concerning the infinite cardinal numbers\".".
- Hardy_hierarchy label "Hardy hierarchy".
- Hardy_hierarchy sameAs Q5656649.
- Hardy_hierarchy sameAs m.09g9yh_.
- Hardy_hierarchy sameAs Q5656649.
- Hardy_hierarchy wasDerivedFrom Hardy_hierarchy?oldid=697558315.
- Hardy_hierarchy isPrimaryTopicOf Hardy_hierarchy.