Comments on: Sieve of Eratosthenes http://imprompt.us/2010/sieve-of-eratosthenes/ Computer Science and Teaching and Other Ancillary Things Sat, 31 Mar 2012 15:41:00 +0000 hourly 1 http://wordpress.org/?v=3.1.4 By: F. Carr http://imprompt.us/2010/sieve-of-eratosthenes/comment-page-1/#comment-16826 F. Carr Fri, 30 Apr 2010 01:38:03 +0000 http://imprompt.us/?p=189#comment-16826 Yeah, that's a cool paper :-) After much mucking about, <a href="http://pastebin.com/qaF5dQjk" rel="nofollow">http://pastebin.com/qaF5dQjk</a> is fairly close (in python) to the gist of it. Yeah, that's a cool paper :-) After much mucking about, http://pastebin.com/qaF5dQjk is fairly close (in python) to the gist of it.

]]> By: Peter Boothe http://imprompt.us/2010/sieve-of-eratosthenes/comment-page-1/#comment-16825 Peter Boothe Wed, 28 Apr 2010 02:28:31 +0000 http://imprompt.us/?p=189#comment-16825 That is an excellent paper. Thanks for the link! That is an excellent paper. Thanks for the link!

]]> By: Matt Brubeck http://imprompt.us/2010/sieve-of-eratosthenes/comment-page-1/#comment-16822 Matt Brubeck Tue, 27 Apr 2010 10:14:33 +0000 http://imprompt.us/?p=189#comment-16822 The classic Haskell code is the Turner Sieve:<br><br><code>primes = sieve [2..]<br>sieve (p : xs) = p : sieve [x | x <? xs, x ‘mod‘ p > 0]</code><br><br>Professor O'Neill at Harvey Mudd College wrote a very nice paper about <a href="http://lambda-the-ultimate.org/node/3127" rel="nofollow">why this isn't the Sieve of Eratosthenes</a>. The Haskell Wiki has <a href="http://www.haskell.org/haskellwiki/Prime_numbers#The_Classic_Turner.27s_Sieve" rel="nofollow">many variations</a>. The classic Haskell code is the Turner Sieve:

primes = sieve [2..]<br>sieve (p : xs) = p : sieve [x | x &lt;? xs, x ‘mod‘ p &gt; 0]

Professor O'Neill at Harvey Mudd College wrote a very nice paper about why this isn't the Sieve of Eratosthenes. The Haskell Wiki has many variations.

]]> By: Titus Winters http://imprompt.us/2010/sieve-of-eratosthenes/comment-page-1/#comment-16821 Titus Winters Tue, 27 Apr 2010 09:40:48 +0000 http://imprompt.us/?p=189#comment-16821 The tutorial for Google's new language "go" uses that same technique (unbounded number of filters) to demonstrate the effectiveness of their lightweight concurrency mechanisms (goroutines and channels). It's particularly beautiful in go, because while not quite as terse as you've got it reduced to here (nice job, btw), it runs on multi-core systems nicely, and compiles down to beautifully fast machine code. The tutorial for Google's new language “go” uses that same technique (unbounded number of filters) to demonstrate the effectiveness of their lightweight concurrency mechanisms (goroutines and channels). It's particularly beautiful in go, because while not quite as terse as you've got it reduced to here (nice job, btw), it runs on multi-core systems nicely, and compiles down to beautifully fast machine code.

]]>