retagged by
271 views

1 Answer

2 votes
2 votes

In computer science, the iterated logarithm of n, written log* n (usually read "logstar"), is the number of times the logarithm function must be iteratively applied before the result is less than or equal to 1.

\log ^{*}n:={\begin{cases}0&{\mbox{if }}n\leq 1;\\1+\log ^{*}(\log n)&{\mbox{if }}n>1\end{cases}}

x                              lg* x

(−∞, 1]                        0

(1, 2]                          1

(2, 4]                          2

(4, 16]                        3

(16, 65536]                 4

(65536, 265536]           5

Let n=16 then

log*log n = log*log 16 = log*(4) =2

log(log*n) = log(log*16) = log(3) = 1.5849 approximately = 2

Related questions

0 votes
0 votes
2 answers
2
raja11sep asked Feb 13, 2022
890 views
Can anyone explain this?
0 votes
0 votes
2 answers
3
dragonball asked Aug 2, 2018
391 views
How the slowness and the fastness of any algorithm depends ?Is (n/logn) is slower than log(logn) ?