OFFSET
2,1
COMMENTS
The number 10^93, known as Bremermann's limit, is the estimated maximum number of bits able to be processed by a hypothetical Earth-sized computer in a period of time equal to the rough estimate of the Earth's age. All numbers greater than Bremermann's limit are labeled as "transcomputational."
REFERENCES
H. J. Bremermann, "Optimization through evolution and recombination" in Self-Organizing Systems, Spartan Books, 1962, pages 93-106.
G. J. Klir, Facets of Systems Science, Springer, 1991, pages 121-128.
LINKS
H. J. Bremermann, Optimization through evolution and recombination
Wikipedia, Transcomputational problem
FORMULA
a(n) = ceiling(93*log(10)/log(n)).
EXAMPLE
For k = 2 (i.e., a set of n Boolean variables), 309 is the corresponding term of this sequence as it is the smallest integer which satisfies 10^93 < 2^n.
MATHEMATICA
Table[Ceiling[93 Log[10] / Log[n]], {n, 2, 51}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Nicholas Leonard, Aug 13 2023
STATUS
approved