Comments on: Cracking a Lock in Haskell with the De Bruijn sequence, pt. 1 http://coder.bsimmons.name/blog/2009/09/cracking-a-lock-in-haskell-with-the-de-bruijn-sequence-pt-1/ fragmentary ideas ䷿ intellectual what-nots ䷷ and haskell programming ䷴ Thu, 22 Jul 2010 21:36:05 +0000 http://wordpress.org/?v=2.9.1 hourly 1 By: The "Prefer Opposite" algorithm in Haskell | LAMBDAPHONE http://coder.bsimmons.name/blog/2009/09/cracking-a-lock-in-haskell-with-the-de-bruijn-sequence-pt-1/comment-page-1/#comment-179 The "Prefer Opposite" algorithm in Haskell | LAMBDAPHONE Wed, 02 Dec 2009 02:30:27 +0000 http://coder.bsimmons.name/blog/?p=215#comment-179 [...] should be an interesting investigation into a possible parallel algorithm. The first two posts are here and [...]

blockquote {
margin: 2em;
padding: .1em 1.5em;
position: relative;
background: #2F2F2F;
}
">

[...] should be an interesting investigation into a possible parallel algorithm. The first two posts are here and [...]

]]> By: Cracking a Lock in Haskell with the De Bruijn sequence, pt. 2 | LAMBDAPHONE http://coder.bsimmons.name/blog/2009/09/cracking-a-lock-in-haskell-with-the-de-bruijn-sequence-pt-1/comment-page-1/#comment-135 Cracking a Lock in Haskell with the De Bruijn sequence, pt. 2 | LAMBDAPHONE Tue, 29 Sep 2009 22:12:10 +0000 http://coder.bsimmons.name/blog/?p=215#comment-135 [...] this post I will rework the Prefer One algorithm from the previous post so that it is much more efficient. We will add words to a Patricia Tree-like dictionary as we see [...]

blockquote {
margin: 2em;
padding: .1em 1.5em;
position: relative;
background: #2F2F2F;
}
">

[...] this post I will rework the Prefer One algorithm from the previous post so that it is much more efficient. We will add words to a Patricia Tree-like dictionary as we see [...]

]]>