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 numbers, large and/or numbers:
“Always in England if you had the type of brain that was capable of understanding T.S. Eliot’s poetry or Kant’s logic, you could be sure of finding large numbers of people who would hate you violently.”
—D.J. Taylor (b. 1960)
“Spring is strong and virtuous,
Broad-sowing, cheerful, plenteous,
Quickening underneath the mould
Grains beyond the price of gold.
So deep and large her bounties are,
That one broad, long midsummer day
Shall to the planet overpay
The ravage of a year of war.”
—Ralph Waldo Emerson (1803–1882)
“I had a feeling that out there, there were very poor people who didn’t have enough to eat. But they wore wonderfully colored rags and did musical numbers up and down the streets together.”
—Jill Robinson (b. 1936)