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:
“A tattered copy of Johnson’s large Dictionary was a great delight to me, on account of the specimens of English versifications which I found in the Introduction. I learned them as if they were so many poems. I used to keep this old volume close to my pillow; and I amused myself when I awoke in the morning by reciting its jingling contrasts of iambic and trochaic and dactylic metre, and thinking what a charming occupation it must be to “make up” verses.”
—Lucy Larcom (1824–1893)
“Publishers are notoriously slothful about numbers, unless they’re attached to dollar signs—unlike journalists, quarterbacks, and felony criminal defendents who tend to be keenly aware of numbers at all times.”
—Hunter S. Thompson (b. 1939)