Jarkko Hietaniemi <[EMAIL PROTECTED]> wrote:

[Re: Giving data about why it's hard to use B:: to port to the JVM]

> Yes, *PLEASE*.  Some hard data is always nice, even when (or especially
> when) it's unpleasant to hear.

I won't have "hard numbers", as it is always completely possible that some
clever hacker could find a way that I couldn't.  What I will do is document
what I tried, why it isn't easy, and what would have to change to make it
easy.

It's always a subjective process when you try to make the case that
something is "hard to do", from a programming point a view, given that the
Turing indicated that it can be done by a program in polynomial time.  There
is not a definitive way to "prove" coming up with that polynomial time
algorithm is hard.  ;)


-- 
Bradley M. Kuhn  -  http://www.ebb.org/bkuhn

PGP signature

Reply via email to