Fast Growing | Hierarchy Calculator

/** * FAST GROWING HIERARCHY CALCULATOR * Supports ordinals up to epsilon_0 (and slightly beyond). * Uses BigInt for arbitrary precision integers. */

Visualizing how quickly functions grow teaches set theory, computability theory, and the subtlety of “slow” vs “fast” growth. An FGH calculator can demonstrate why Goodstein’s theorem or the Paris-Harrington principle is true but unprovable in Peano arithmetic. fast growing hierarchy calculator

Consider the fast-growing hierarchy for ( f_ω(n) ): /** * FAST GROWING HIERARCHY CALCULATOR * Supports