Hardy hierarchy
id:
hardy-hierarchy-276-10756590
title:
Hardy hierarchy
text:
In computability theory, computational complexity theory and proof theory, the Hardy hierarchy, named after G. H. Hardy, is a hierarchy of sets of numerical functions generated from an ordinal-indexed family of functions hα: N → N called Hardy functions. It is related to the fast-growing hierarchy and slow-growing hierarchy. Hardy hierarchy is introduced by Stanley S. Wainer in 1972, but the idea of its definition comes from Hardy's 1904 paper, in which Hardy exhibits a set of reals with cardina
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hardy_hierarchy
date created:
date modified:
2024-02-29T19:13:55Z
main entity:
{"identifier":"Q5656649","url":"https://www.wikidata.org/entity/Q5656649"}
image:
fields total:
13
integrity:
13