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:
“The tumultuous populace of large cities are ever to be dreaded. Their indiscriminate violence prostrates for the time all public authority, and its consequences are sometimes extensive and terrible.”
—George Washington (1732–1799)
“He bundles every forkful in its place,
And tags and numbers it for future reference,
So he can find and easily dislodge it
In the unloading. Silas does that well.
He takes it out in bunches like birds’ nests.”
—Robert Frost (1874–1963)