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 would rather be kept alive in the efficient if cold altruism of a large hospital than expire in a gush of warm sympathy in a small one.”
—Aneurin Bevan (1897–1960)
“I had but three chairs in my house; one for solitude, two for friendship; three for society. When visitors came in larger and unexpected numbers there was but the third chair for them all, but they generally economized the room by standing up.”
—Henry David Thoreau (1817–1862)