pdany
Re:The Prolog Story
on Thursday May 20, 2010 @05:37PM (#1365519)
I never participated in IOI, but at least in ACM contests I have never seen a problem where suboptimal heuristic search was allowed.
Re:The Prolog Story
on Thursday May 20, 2010 @05:26PM (#1365471)
Well a lot of prolog implementations also feature finite domain and rational domain solvers, global constrains that I don't think your 15 year old buddies would be able to code in an hour.
Having said that, most problems we solve here are NP-Complete, most of the time the trivial pruning you are mentioning does not really extend the limits for the computation.
Re:PyPy is the Future of Python
on Sunday May 16, 2010 @04:57PM (#1352770)
I think you are overestimating the current capabilities of JIT's.
Also, unfortunately, current compilers are notoriously bad at generating code with special instructions (vectorized code).
So in the end applications that need to be really fast end up being written in assembly, or carefully written fortran and C code to generate a particular assembly.