Iterated logarithm

In computer science, the iterated logarithm of n, written log* n (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 recursive function: On the positive real numbers, the continuous super-logarithm (inverse tetration) is essentially equivalent: but on the negative real numbers, log-star is 0, whereas for positive x, so the two functions differ for negative arguments. .

Iterated logarithm

In computer science, the iterated logarithm of n, written log* n (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 recursive function: On the positive real numbers, the continuous super-logarithm (inverse tetration) is essentially equivalent: but on the negative real numbers, log-star is 0, whereas for positive x, so the two functions differ for negative arguments. .