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:
“We can see nothing whatever of the soul unless it is visible in the expression of the countenance; one might call the faces at a large assembly of people a history of the human soul written in a kind of Chinese ideograms.”
—G.C. (Georg Christoph)
“One murder makes a villain, millions a hero. Numbers sanctify, my good fellow.”
—Charlie Chaplin (1889–1977)