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:
“Every society consists of men in the process of developing from children into parents. To assure continuity of tradition, society must early prepare for parenthood in its children; and it must take care of the unavoidable remnants of infantility in its adults. This is a large order, especially since a society needs many beings who can follow, a few who can lead, and some who can do both, alternately or in different areas of life.”
—Erik H. Erikson (1904–1994)
“And when all bodies meet
In Lethe to be drowned,
Then only numbers sweet
With endless life are crowned.”
—Robert Herrick (1591–1674)