Large Numbers in Some Noncomputable Sequences
The busy beaver function Σ is an example of a function which grows faster than any computable function. Its value for even relatively small input is huge. The values of Σ(n) for n = 1, 2, 3, 4 are 1, 4, 6, 13 (sequence A028444 in OEIS). Σ(5) is not known but is definitely ≥ 4098. Σ(6) is at least 3.5×1018267.
Some of the work by Harvey Friedman also involve sequences that grow faster than any computable function.
Read more about this topic: Large Numbers
Famous quotes containing the words large and/or numbers:
“If I’m not so large as you,
You are not so small as I,
And not half so spry.”
—Ralph Waldo Emerson (1803–1882)
“The forward Youth that would appear
Must now forsake his Muses dear,
Nor in the Shadows sing
His Numbers languishing.”
—Andrew Marvell (1621–1678)