Large Numbers - Large Numbers in Some Noncomputable Sequences

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:

    The passions are the same in every conflict, large or small.
    Mason Cooley (b. 1927)

    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)