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:
“I count him a great man who inhabits a higher sphere of thought, into which other men rise with labor and difficulty; he has but to open his eyes to see things in a true light, and in large relations; whilst they must make painful corrections, and keep a vigilant eye on many sources of error.”
—Ralph Waldo Emerson (1803–1882)
“All ye poets of the age,
All ye witlings of the stage,
Learn your jingles to reform,
Crop your numbers to conform.
Let your little verses flow
Gently, sweetly, row by row;
Let the verse the subject fit,
Little subject, little wit.
Namby-Pamby is your guide,
Albion’s joy, Hibernia’s pride.”
—Henry Carey (1693?–1743)