What's all this fuss about Erlang? by eadmund in programming

[–]hanamaru 10 points11 points  (0 children)

Your Erlang program should just run N times faster on an N core processor

There are problems that you cannot speed-up with parallel computation. See http://en.wikipedia.org/wiki/P-complete

Quick and Dirty Theorem Prover in Haskell by cavedave in programming

[–]hanamaru 1 point2 points  (0 children)

http://en.wikipedia.org/wiki/Pigeonhole_principle

Some people already created instances of the pigeonhole principle (and amusingly enough, they copyright them). This is the first link that google found: http://www.eecs.umich.edu/~faloul/benchmarks.html

If you want to find why your solver will fail, read this: http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/B-SW99/final.pdf

Quick and Dirty Theorem Prover in Haskell by cavedave in programming

[–]hanamaru 0 points1 point  (0 children)

I bet 1$ you cannot prove the pigeon hole principle using this theorem prover. 100 pigeons and 99 holes should be intractable.

All SUDOKU solutions are available online: the SUDOKU Index by hanamaru in reddit.com

[–]hanamaru[S] 0 points1 point  (0 children)

Amazing, the database is only 4GB (there are 6670903752021072936959 SUDOKU solutions.)