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:
“Insults from an adolescent daughter are more painful, because they are seen as coming not from a child who lashes out impulsively, who has moments of intense anger and of negative feelings which are not integrated into that large body of responses, impressions and emotions we call ‘our feelings for someone,’ but instead they are coming from someone who is seen to know what she does.”
—Terri Apter (20th century)
“The land cannot be cleansed of the blood that is shed therein, but by the blood of him that shed it.”
—Bible: Hebrew Numbers 35:33.