For the theorem in probability theory, see Law of the iterated logarithm.
In computer science, the iterated logarithm of , written log* (usually read "log star"), is the number of times the logarithm function must be iteratively applied before the result is less than or equal to .[1] The simplest formal definition is the result of this recurrence relation:
On the positive real numbers, the continuous super-logarithm (inverse tetration) is essentially equivalent:
i.e. the base b iterated logarithm is if n lies within the interval , where denotes tetration. However, on the negative real numbers, log-star is , whereas for positive , so the two functions differ for negative arguments.
The iterated logarithm accepts any positive real number and yields an integer. Graphically, it can be understood as the number of "zig-zags" needed in Figure 1 to reach the interval on the x-axis.
In computer science, lg* is often used to indicate the binary iterated logarithm, which iterates the binary logarithm (with base ) instead of the natural logarithm (with base e).
Mathematically, the iterated logarithm is well-defined for any base greater than , not only for base and base e.
^Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. "The iterated logarithm function, in Section 3.2: Standard notations and common functions". Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. pp. 58–59. ISBN 0-262-03384-4.
and 24 Related for: Iterated logarithm information
the iteratedlogarithm of n {\displaystyle n} , written log* n {\displaystyle n} (usually read "log star"), is the number of times the logarithm function...
the iteratedlogarithm describes the magnitude of the fluctuations of a random walk. The original statement of the law of the iteratedlogarithm is due...
Approximating natural exponents (log base e) Iteratedlogarithm Napierian logarithm List of logarithmic identities Logarithm of a matrix Logarithmic coordinates...
include the double logarithm ln(ln(x)), the super- or hyper-4-logarithm (a slight variation of which is called iteratedlogarithm in computer science)...
iterated exponentials, as it is common to call expressions of this form iterated exponentiation, which is ambiguous, as this can either mean iterated...
In mathematics, the Wiener process is a real-valued continuous-time stochastic process named in honor of American mathematician Norbert Wiener for his...
binary logarithm of 1 is 0, the binary logarithm of 2 is 1, the binary logarithm of 4 is 2, and the binary logarithm of 32 is 5. The binary logarithm is the...
definition of an iterated function on a set X follows. Let X be a set and f: X → X be a function. Defining f n as the n-th iterate of f (a notation introduced...
Invariance Principle for the Law of the IteratedLogarithm defined a functional form of the law of the iteratedlogarithm, showing a form of scale invariance...
straightened by plotting them using a logarithmic scale for the growth axis. Iteratedlogarithm – Inverse function to a tower of powers (an even slower growth model)...
functions Meijer G-function Fox H-function Hyper operators Iteratedlogarithm Pentation Super-logarithms Tetration Lambert W function: Inverse of f(w) = w exp(w)...
founders of modern probability theory, discovering the law of the iteratedlogarithm in 1924, achieving important results in the field of limit theorems...
relative error between their logarithms is still large; however, the relative error in their second-iteratedlogarithms is small: log 10 ( log 10 ...
the form of F. Another result, which follows from the law of the iteratedlogarithm, is that lim supn→∞n‖F^n−F‖∞2lnlnn≤12,a.s.{\displaystyle \limsup...
Cajori, Florian (1952) [March 1929]. "§472. The power of a logarithm / §473. Iteratedlogarithms / §533. John Herschel's notation for inverse functions /...
chance of landing on 2. The central limit theorem and the law of the iteratedlogarithm describe important aspects of the behavior of simple random walks...
also be multiplied by a slowly varying function of n. The law of the iteratedlogarithm specifies what is happening "in between" the law of large numbers...
deviation principle Law of large numbers (weak/strong) Law of the iteratedlogarithm Maximal ergodic theorem Sanov's theorem Zero–one laws (Blumenthal...
at most proportional to its logarithm; therefore, the additive persistence is at most proportional to the iteratedlogarithm, and the smallest number of...
where the number of terms in the sum is bounded above by the binary iteratedlogarithm. To be precise, let f ( x ) = ⌊ log 2 x ⌋ {\displaystyle f(x)=\lfloor...
primarily useful for functions that grow extremely slowly: (binary) iteratedlogarithm (log*) is less than 5 for all practical data (265536 bits); (binary)...
deviation principle Law of large numbers (weak/strong) Law of the iteratedlogarithm Maximal ergodic theorem Sanov's theorem Zero–one laws (Blumenthal...
deviation principle Law of large numbers (weak/strong) Law of the iteratedlogarithm Maximal ergodic theorem Sanov's theorem Zero–one laws (Blumenthal...