Fast-Growing Hierarchy: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

13 August 2025

11 August 2025

15 August 2024

14 August 2024

  • curprev 18:3018:30, 14 August 2024‎ Racheline talk contribs‎ 1,962 bytes +1,962‎ Created page with "A Fast-Growing Hierarchy (FGH) is an ordinal-indexed hierarchy of functions satisfying certain restrictions. FGHs are used for assigning growth rates to fast computable functions, and are useful for approximating scores and halting times of Turing machines. == Definition == Given a system of fundamental sequences for limit ordinals below <math>\lambda</math>, its corresponding FGH is defined by <math display="block">\begin{array}{l} f_0(n) & = & n+1 \\ f_{\alpha+1..."
Retrieved from "https://wiki.bbchallenge.org/wiki/Fast-Growing_Hierarchy"