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)
“Unionism seldom, if ever, uses such power as it has to insure better work; almost always it devotes a large part of that power to safeguarding bad work.”
—H.L. (Henry Lewis)
“Out of the darkness where Philomela sat,
Her fairy numbers issued. What then ailed me?
My ears are called capacious but they failed me,
Her classics registered a little flat!
I rose, and venomously spat.”
—John Crowe Ransom (1888–1974)