On Jun 21, 3:21 am, John G Harris <j...@nospam.demon.co.uk> wrote:
> On Wed, 20 Jun 2012 at 14:10:48, in comp.lang.javascript, wrote:
> >On Sunday, November 22, 2009 4:58:25 AM UTC-6, John G Harris wrote:
> >> On Sat, 21 Nov 2009 at 20:38:04, in comp.lang.javascript, debaser wrote:
> >> >// SUBSET-SUM. = np>
> >> >// This is a polynomial-time algorithm if and only if P= NP.
> >> >//
> >> >// "Polynomial-time" means it returns "YES" in polynomial time when
> >> >// the answer should be "YES", and runs forever when it's "NO".
>
> >> If it can run for ever then it's not an algorithm, twit.
>
> >> John
> >> --
> >> John Harris
>
> >What is a not an algorithm, twit.?
>
> Spam alert!
>
> For anyone else who's not sure : a requirement for any algorithm is that
> it always produces a definite answer in a finite time. If it doesn't you
> have to call it something else, e.g broken.
>
> Some problems don't have algorithms. This is where it can be proved that
> whatever proposed algorithm is used, some cases will cause the code to
> run forever without producing an answer.
>
> Hope that helps. (I won't bother explaining what NP really is).
>
> John
> --
> John Harris
time year meld Jun result compare by date follow search magnet to
month over year criteria priority implement by Musatov for nsa
cia
Musatov M u s a t o v M u s a t o v