User talk:IanOsgood: Difference between revisions

Line 10:

:Yes, that option is checked by default. --[[User:IanOsgood|IanOsgood]] 23:16, 17 October 2007 (MDT)

::Great. The nice thing is, the more times the bots try to log in using a banned account, the more bad IPs get blocked. (I'm fairly sure most of the bad IPs are from Tor nodes.) --[[User:Short Circuit|Short Circuit]] 23:20, 17 October 2007 (MDT)

===Forth===

==Forth==

My Forth is very rusty, but it looks like your Forth version of the [[Sieve_of_Eratosthenes]] lacks both important features of the sieve: The outer loop should stop at the sqrt of the total limit, and the inner loop should start with the square of the just detected prime (any other multiples must already have been crossed out). Without those, the sieve won't be faster than to trial division for each number. Some other implementations seem to have the same problem. (And some only sieve odd numbers, while others don't, making overall comparison between languages more difficult). Maybe all this should also be clarified in the task description? [[User:Dirkt|Dirkt]] 02:48, 2 December 2007 (MST)

----

Would you be interested in writing a Forth implementation of [[RCBF]]? Mwn3d is working on a Java version. I'm hoping someone writes a version in Lisp or Haskell. --[[User:Short Circuit|Short Circuit]] 20:11, 26 November 2007 (MST)

: [[RCBF (Haskell)]] version done. --[[User:Dirkt|Dirkt]] 09:41, 28 November 2007 (MST)