Or maybe he is the Conway from the Game of Life. In any case, we'll keep our Conway. (With apologies to TimToady).
I've seen the Minesweeper-NP-completeness thing before. I was trying to make a program to play minesweeper a while back, ran across that paper, and gave up. The solution would have been either a boring brute-force algorithm, or something that would get me a whole heap of cash when I used it to break encrypted credit cards win the NP-complete challenge contest.
"There is no shame in being self-taught, only in not trying to learn in the first place." -- Atrus, Myst: The Book of D'ni.
In reply to Re^7: modules = minilanguages?
by hardburn
in thread modules = minilanguages?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |