About: Slow-growing hierarchy   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

The slow-growing hierarchy (SGH) is a certain hierarchy mapping ordinals \(\alpha\) to functions \(g_\alpha: \mathbb{N} ightarrow \mathbb{N}\). Like its name suggests, it grows much slower than its cousins the fast-growing hierarchy and the Hardy hierarchy. The functions are defined as follows: * \(g_0(n) = 0\) * \(g_{\alpha+1}(n) = g_\alpha(n)+1\) * \(g_\alpha(n) = g_{\alpha[n]}(n)\) when \(\alpha\) is a limit ordinal

AttributesValues
rdfs:label
  • Slow-growing hierarchy
rdfs:comment
  • The slow-growing hierarchy (SGH) is a certain hierarchy mapping ordinals \(\alpha\) to functions \(g_\alpha: \mathbb{N} ightarrow \mathbb{N}\). Like its name suggests, it grows much slower than its cousins the fast-growing hierarchy and the Hardy hierarchy. The functions are defined as follows: * \(g_0(n) = 0\) * \(g_{\alpha+1}(n) = g_\alpha(n)+1\) * \(g_\alpha(n) = g_{\alpha[n]}(n)\) when \(\alpha\) is a limit ordinal
sameAs
dcterms:subject
abstract
  • The slow-growing hierarchy (SGH) is a certain hierarchy mapping ordinals \(\alpha\) to functions \(g_\alpha: \mathbb{N} ightarrow \mathbb{N}\). Like its name suggests, it grows much slower than its cousins the fast-growing hierarchy and the Hardy hierarchy. The functions are defined as follows: * \(g_0(n) = 0\) * \(g_{\alpha+1}(n) = g_\alpha(n)+1\) * \(g_\alpha(n) = g_{\alpha[n]}(n)\) when \(\alpha\) is a limit ordinal \(\alpha[n]\) denotes the \(n\)th term of the fundamental sequence assigned to ordinal \(\alpha\). Definitions of \(\alpha[n]\) can vary, giving different slow-growing hierarchies. One such hierarchy is the Wainer hierarchy, which is explained in the article for fast-growing hierarchy. For small ordinals, SGH is nowhere close to FGH. \(g_{\varepsilon_0}(n)\) only reaches the level of \(f_3(n)\), and SGH does not reach \(f_{\varepsilon_0}(n)\) until the Bachmann-Howard ordinal. Unlike its relatives, SGH is extremely sensitive to the definitions of fundamental sequences: using the most "natural" version SGH catches up FGH at \(\psi_0(\Omega_\omega)\). Other systems of fundamental sequences, however, have this 'catching ordinal' at \(\varepsilon_0\), \(\vartheta(\Omega^\Omega)\), or even beyond \(\psi(\psi_I(0))\) in some cases. To googologists, SGH is not quite as useful as FGH. It grows the slowest of all the ordinal hierarchies, so it may be the best suited to stratify the growth rates of functions, if the fundamental sequences are properly specified. However, it has been theorized that it may be useful in creating fast growing functions in a similar manner to Goodstein sequences.
is wikipage disambiguates of
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software