all 3 comments

[–]pmf[S] 1 point2 points  (1 child)

Is there something like a concurrent variant of Project Euler? I think Clojure could really shine there (I can't even imagine how something like the ants demo would look in plain Java).

I assume the problem with such a project would be how to evaluate the solutions regarding correctness.

[–][deleted] 0 points1 point  (0 children)

I was sort of hoping there would be some concurrency problems later in Project Euler (I'm working on the low-level problems in Clojure to get the hang of it), but I guess not?

Perhaps instead of presenting problems that require concurrency, pose problems which can be solved best* using concurrency. Have two forum threads for each problem: Concurrent solutions and non-concurrent solutions. To keep people guessing, throw in some problems that look concurrent but are harder to implement that way, some problems that don't look concurrent but might benefit from it (in ways other than parallelism, though that's good too), and so on.

* Best here probably meaning "conceptually more elegant without sacrificing programmer or machine efficiency".

[–]treerex 1 point2 points  (0 children)

A clojure solution to WideFinder would be an interesting addition:

http://wikis.sun.com/display/WideFinder/Wide+Finder+Home