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:
“To be rich nowadays merely means to possess a large number of poor objects.”
—Raoul Vaneigem (b. 1934)
“... there are persons who seem to have overcome obstacles and by character and perseverance to have risen to the top. But we have no record of the numbers of able persons who fall by the wayside, persons who, with enough encouragement and opportunity, might make great contributions.”
—Mary Barnett Gilson (1877–?)