Centuries later, Euclid's algorithm was discovered independently both in India and in China, primarily to solve Diophantine equations that arise in astronomy and making accurate calendars.
Another spigot algorithm, the BBP digit extraction algorithm, was discovered in 1995 by Simon Plouffe: : \pi = \sum_{i=0}^\infty \frac{1}{16^i} \left( \frac{4}{8i + 1} - \frac{2}{8i + 4} - \frac{1}{8i + 5} - \frac{1}{8i + 6}\right) This formula, unlike others before it, can produce any individual hexadecimal digit of without calculating all the preceding digits.
Two algorithms were discovered in 1995 that opened up new avenues of research into.
It is also possible that as a result of using EMA algorithm, the disorder is discovered at an early stage, before the cavities are formed.
In addition, another benefit of this novel estimation algorithm not found previously is discovered; that is, the estimation of path parameters, including Doppler frequency, can be performed by using only a fraction of the SC's output.
Whenever a new planet is discovered, a complex algorithm automatically generates its landscape, flora and fauna.
Variations of the algorithm have been discovered, but no digit extraction algorithm has yet been found that rapidly produces decimal digits.
One of the embarrassments of quantum computing is the fact that, so far, only one algorithm has been discovered, namely Shor's, for which a quantum computer is significantly faster than any known classical one.
Several algorithms have been discovered which can be implemented on such devices which run faster than the best known classical algorithms for the same problem.
In particular, no polynomial time quantum algorithms have been discovered for solving \ \textbf{NP}\ -complete problems which are implementable on the more widely accepted models of quantum computation.
