Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hardy_hierarchy> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items 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 kruskal1.pdf.
- Hardy_hierarchy wikiPageExternalLink kruskal2.pdf.
- Hardy_hierarchy wikiPageExternalLink kruskal3.pdf.
- Hardy_hierarchy wikiPageExternalLink goodstein.pdf.
- Hardy_hierarchy wikiPageID "25264191".
- Hardy_hierarchy wikiPageRevisionID "447604733".
- Hardy_hierarchy hasPhotoCollection Hardy_hierarchy.
- Hardy_hierarchy subject Category:Computability_theory.
- Hardy_hierarchy subject Category:Hierarchy_of_functions.
- Hardy_hierarchy subject Category:Proof_theory.
- 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 m.09g9yh_.
- Hardy_hierarchy sameAs Q5656649.
- Hardy_hierarchy sameAs Q5656649.
- Hardy_hierarchy wasDerivedFrom Hardy_hierarchy?oldid=447604733.
- Hardy_hierarchy isPrimaryTopicOf Hardy_hierarchy.