Smaller numbers

The term "uncomputable number" here refers to the numbers defined in terms of uncomputably fast-growing functions.

Note: The special cases of Oblivion, Utter Oblivion, the iota function, and Hollom's number are not listed due to questionable well-definedness.

Busy beaver numbersEdit

These numbers arise from functions that eventually dominate all computable functions, and are based on the unsolvability of the halting problem. They exploit the maximum scores of a particular Turing machine given the condition that they will halt. They have growth rates of at least \(\omega_1^\text{CK}\) of the fast-growing hierarchy.

Rayo numbersEdit

These numbers diagonalize over nth-order mathematical theories: Rayo's function diagonalizes over first-order set theory, and the derived FOOT function diagonalizes over nth-order set theory. They are currently the largest well-defined named numbers in professional mathematics.

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.