New page: The sieve of Eratohsthenes is an ancient, yet efficient, algorithm for producing prime numbers from interval 2-N for arbitrary N. I am using a vari...
New page
The [[wikipedia:Sieve_of_Eratosthenes|sieve of Eratohsthenes]] is an ancient, yet efficient, algorithm for producing prime numbers from interval 2-N for arbitrary N.
[[I]] am using a variant of this algorithm in my [http://github.com/jtulach/sieve sieve project] to measure [[Turing Speed]] of various [[language]]s and demonstrate that [[Truffle]] based languages on top of [[GraalVM]] are running at full (Turing) speed.
[[I]] am using a variant of this algorithm in my [http://github.com/jtulach/sieve sieve project] to measure [[Turing Speed]] of various [[language]]s and demonstrate that [[Truffle]] based languages on top of [[GraalVM]] are running at full (Turing) speed.