Applications in Computational Number Theory
Well-known Monte Carlo algorithms include the Solovay–Strassen primality test, the Miller–Rabin primality test, and certain fast variants of the Schreier–Sims algorithm in computational group theory.
Read more about this topic: Monte Carlo Algorithm
Famous quotes containing the words number and/or theory:
“It is not the number of years we have behind us, but the number we have before us, that makes us careful and responsible and determined to find out the truth about everything.”
—George Bernard Shaw (1856–1950)
“Everything to which we concede existence is a posit from the standpoint of a description of the theory-building process, and simultaneously real from the standpoint of the theory that is being built. Nor let us look down on the standpoint of the theory as make-believe; for we can never do better than occupy the standpoint of some theory or other, the best we can muster at the time.”
—Willard Van Orman Quine (b. 1908)