Double exponential function

From Wikipedia, the free encyclopedia

This article is about double exponential functions. For the double exponential distribution, see Laplace distribution.

A double exponential function is a constant raised to the power of an exponential function. The general formula is f(x) = a^{b^x}, which grows even faster than an exponential function. For example, if a = b = 10:

  • f(−1) ≈ 1.26
  • f(0) = 10
  • f(1) = 1010
  • f(2) = 10100 = googol
  • f(3) = 101000
  • f(100) = 1010^100 = googolplex

Factorials grow faster than exponential functions, but much slower than double-exponential functions. Compare the hyper-exponential function, which grows even faster.

Contents

[edit] Doubly exponential sequences

The nth value of each of the following integer sequences is proportional to a double exponential function of n. Although the sequences themselves are not double exponential functions, they can be defined using formulas in which such functions appear.

F(m) = 2^{2^m}+1
MM(p) = 2^{2^p-1}-1
s_n = \left\lfloor E^{2^{n+1}}+\frac12 \right\rfloor
where E ≈ 1.26408 is Vardi's constant (sequence A076393 in OEIS).

Aho and Sloane (1973) investigate several other sequences that, like Sylvester's sequence, can be formed by rounding to the nearest integer the values of a doubly exponential function, and provide general conditions on the values of a sequence that cause it to be of this type.

[edit] Applications

In computational complexity theory, some algorithms take double-exponential time:

  • Finding a complete set of associative-commutative unifiers [1]
  • Satisfying CTL+ (which is, in fact, 2-EXPTIME-complete) [2]

Likewise, some number theoretical upper bounds are double exponential. Odd perfect numbers with n distinct prime factors are known to be at most

2^{4^n}

a result of Nielsen (2003).[3]

[edit] See also

[edit] Further reading

A. V. Aho and N. J. A. Sloane, "Some doubly exponential sequences", Fibonacci Quarterly Vol. 11 (1973), pp. 429–437.