Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.javascript > #32657 > unrolled thread

Update only if not already in array

Back to article view | Back to comp.lang.javascript

Contents

  Update only if not already in array jonas.thornvall@gmail.com - 2017-03-01 05:36 -0800
    Re: Update only if not already in array Julio Di Egidio <julio@diegidio.name> - 2017-03-01 05:53 -0800
      Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-01 07:29 -0800
        Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-01 12:04 -0800
          Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-03 02:27 -0800
            Re: Update only if not already in array "Evertjan." <exxjxw.hannivoort@inter.nl.net> - 2017-03-03 13:02 +0100
              Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-03 09:07 -0800
                Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-03 09:13 -0800
                Re: Update only if not already in array "Evertjan." <exxjxw.hannivoort@inter.nl.net> - 2017-03-03 18:20 +0100
                  Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-03 14:30 -0800
                    Re: Update only if not already in array "Evertjan." <exxjxw.hannivoort@inter.nl.net> - 2017-03-03 23:41 +0100
                      Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-03 14:48 -0800
                      Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-03 14:52 -0800
                        Re: Update only if not already in array "Evertjan." <exxjxw.hannivoort@inter.nl.net> - 2017-03-04 00:07 +0100
                          Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-03 16:00 -0800
                            Re: Update only if not already in array "Evertjan." <exxjxw.hannivoort@inter.nl.net> - 2017-03-04 12:35 +0100
                              Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-04 06:00 -0800
                                Re: Update only if not already in array "Evertjan." <exxjxw.hannivoort@inter.nl.net> - 2017-03-04 15:24 +0100
                            Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-04 07:02 -0800
                              Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-04 15:51 +0000
                                Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-04 09:57 -0800
                                  Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-04 20:56 +0000
                                    Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-04 15:30 -0800
                                      Re: Update only if not already in array jonas.thornvall@gmail.com - 2017-03-04 15:37 -0800
                                        Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-05 00:41 +0000
                                      Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-05 00:29 +0000
                                        Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-05 06:26 -0800
                                          Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-05 15:00 +0000
                                            Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-06 07:50 -0800
                                              Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-07 00:50 +0000
                                                Re: Update only if not already in array Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2017-03-07 06:46 +0100
                                                  Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-07 11:23 +0000
                                                    Re: Update only if not already in array Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2017-03-07 15:34 +0100
                                                      Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-07 16:47 +0000
                                                        Re: Update only if not already in array Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2017-03-07 17:55 +0100
                                                          Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-07 17:28 +0000
                                                            Re: Update only if not already in array Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2017-03-07 21:07 +0100
                                                              Re: Update only if not already in array Flippie Flink <flip@flink.not> - 2017-03-07 22:29 +0100
                                                Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-11 18:24 -0800
                                                  Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-15 17:32 +0000
                                                    Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-15 10:59 -0700
                                                      Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 03:49 +0000
                                                        Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-18 11:46 -0700
                                                          Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 20:12 +0000
                                                            Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 20:45 +0000
                                                            Re: Update only if not already in array "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2017-03-26 11:54 -0700
                                                              Re: Update only if not already in array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-27 22:48 +0100
    Re: Update only if not already in array "Evertjan." <exxjxw.hannivoort@inter.nl.net> - 2017-03-01 15:32 +0100

Page 1 of 3  [1] 2 3  Next page →

#32657 — Update only if not already in array

I update a subarray dependent upon another array of marked nodes.

The update seem to work fine but it should only push values to the array if they are not already in the array, i can see i probably should use arr.index.Of to see if it is within array, but what will it return if it is not inarray?

Because it is only then i should do the push to array?

function createMarkedLinks(){
 for (var t=0;t<marklist.length-1;t++){
    alert(marklist+" marklist length= "+marklist.length);
    var j=0;
    currentnode=marklist[t];
        alert("currentnode="+ marklist[t]);
    for (var s=1;s<marklist.length;s++){
    nextnode=marklist[s];
    inarray=arr.indexOf(nextnode);
    if (inarray==undefined){ 
  //What value will inarray have if nextnode not in array????
    alert("nextnode="+ marklist[s]);
    arr[currentnode].nodelinks.push(nextnode);
    arr[nextnode].nodelinks.push(currentnode);
    }
   }
 }
  autotext="";
  update_GraphData();
}

[toc] | [next] | [standalone]

#32658

On Wednesday, March 1, 2017 at 2:37:14 PM UTC+1, jonas.t...@gmail.com wrote:

>     inarray=arr.indexOf(nextnode);
>     if (inarray==undefined){ 
>   //What value will inarray have if nextnode not in array????

<https://www.google.com/search?q=mdn+javascript+array+indexof>

Julio

[toc] | [prev] | [next] | [standalone]

#32660

Den onsdag 1 mars 2017 kl. 14:53:19 UTC+1 skrev Julio Di Egidio:
> On Wednesday, March 1, 2017 at 2:37:14 PM UTC+1, jonas.t...@gmail.com wrote:
> 
> >     inarray=arr.indexOf(nextnode);
> >     if (inarray==undefined){ 
> >   //What value will inarray have if nextnode not in array????
> 
> <https://www.google.com/search?q=mdn+javascript+array+indexof>
> 
> Julio

Thanks Julio and Evertjan works now.

function createMarkedLinks(){
 for (var t=0;t<marklist.length-1;t++){
    alert(marklist+" marklist length= "+marklist.length);
    var j=0;
    currentnode=marklist[t];
        alert("currentnode="+ marklist[t]);
    for (var s=1;s<marklist.length;s++){
    nextnode=marklist[s];
    inarray=arr[currentnode].nodelinks.indexOf(nextnode);
if (inarray==-1){
    alert("nextnode="+ marklist[s]);
    arr[currentnode].nodelinks.push(nextnode);
    arr[nextnode].nodelinks.push(currentnode);
  }
   }
 }
  autotext="";
  update_GraphData();
}

[toc] | [prev] | [next] | [standalone]

#32661

Den onsdag 1 mars 2017 kl. 16:29:33 UTC+1 skrev jonas.t...@gmail.com:
> Den onsdag 1 mars 2017 kl. 14:53:19 UTC+1 skrev Julio Di Egidio:
> > On Wednesday, March 1, 2017 at 2:37:14 PM UTC+1, jonas.t...@gmail.com wrote:
> > 
> > >     inarray=arr.indexOf(nextnode);
> > >     if (inarray==undefined){ 
> > >   //What value will inarray have if nextnode not in array????
> > 
> > <https://www.google.com/search?q=mdn+javascript+array+indexof>
> > 
> > Julio
> 
> Thanks Julio and Evertjan works now.
> 
> function createMarkedLinks(){
>  for (var t=0;t<marklist.length-1;t++){
>     alert(marklist+" marklist length= "+marklist.length);
>     var j=0;
>     currentnode=marklist[t];
>         alert("currentnode="+ marklist[t]);
>     for (var s=1;s<marklist.length;s++){
>     nextnode=marklist[s];
>     inarray=arr[currentnode].nodelinks.indexOf(nextnode);
> if (inarray==-1){
>     alert("nextnode="+ marklist[s]);
>     arr[currentnode].nodelinks.push(nextnode);
>     arr[nextnode].nodelinks.push(currentnode);
>   }
>    }
>  }
>   autotext="";
>   update_GraphData();
> }

Well the final solutions work but it is rather ugly, there probably is a standardised way to increment 2 counters?

Say marklist contain N 4,5,6,7 i do generate the following links on each node using the counters. But the code isn't directly easy to follow.
N 4 Links-> 5,6,7
N 5 Links-> 4,6,7
N 6 Links-> 4,5,7
N 7 Links-> 4,5,6


function createMarkedLinks(){
 var y=0;
 marklist.sort();
 for (var t=0;t<marklist.length-1;t++){
    var x=y;
    y++;
    currentnode=marklist[t];
    for (var s=1+x;s<marklist.length;s++){
       nextnode=marklist[s];
       x++;
       inarray=arr[currentnode].nodelinks.indexOf(nextnode);
       if (inarray==-1){
           arr[currentnode].nodelinks.push(nextnode);
           arr[nextnode].nodelinks.push(currentnode);
       }
   }
 }
  autotext="";
  update_GraphData();
}

[toc] | [prev] | [next] | [standalone]

#32662

Den onsdag 1 mars 2017 kl. 21:04:59 UTC+1 skrev jonas.t...@gmail.com:
> Den onsdag 1 mars 2017 kl. 16:29:33 UTC+1 skrev jonas.t...@gmail.com:
> > Den onsdag 1 mars 2017 kl. 14:53:19 UTC+1 skrev Julio Di Egidio:
> > > On Wednesday, March 1, 2017 at 2:37:14 PM UTC+1, jonas.t...@gmail.com wrote:
> > > 
> > > >     inarray=arr.indexOf(nextnode);
> > > >     if (inarray==undefined){ 
> > > >   //What value will inarray have if nextnode not in array????
> > > 
> > > <https://www.google.com/search?q=mdn+javascript+array+indexof>
> > > 
> > > Julio
> > 
> > Thanks Julio and Evertjan works now.
> > 
> > function createMarkedLinks(){
> >  for (var t=0;t<marklist.length-1;t++){
> >     alert(marklist+" marklist length= "+marklist.length);
> >     var j=0;
> >     currentnode=marklist[t];
> >         alert("currentnode="+ marklist[t]);
> >     for (var s=1;s<marklist.length;s++){
> >     nextnode=marklist[s];
> >     inarray=arr[currentnode].nodelinks.indexOf(nextnode);
> > if (inarray==-1){
> >     alert("nextnode="+ marklist[s]);
> >     arr[currentnode].nodelinks.push(nextnode);
> >     arr[nextnode].nodelinks.push(currentnode);
> >   }
> >    }
> >  }
> >   autotext="";
> >   update_GraphData();
> > }
> 
> Well the final solutions work but it is rather ugly, there probably is a standardised way to increment 2 counters?
> 
> Say marklist contain N 4,5,6,7 i do generate the following links on each node using the counters. But the code isn't directly easy to follow.
> N 4 Links-> 5,6,7
> N 5 Links-> 4,6,7
> N 6 Links-> 4,5,7
> N 7 Links-> 4,5,6
> 
> 
> function createMarkedLinks(){
>  var y=0;
>  marklist.sort();
>  for (var t=0;t<marklist.length-1;t++){
>     var x=y;
>     y++;
>     currentnode=marklist[t];
>     for (var s=1+x;s<marklist.length;s++){
>        nextnode=marklist[s];
>        x++;
>        inarray=arr[currentnode].nodelinks.indexOf(nextnode);
>        if (inarray==-1){
>            arr[currentnode].nodelinks.push(nextnode);
>            arr[nextnode].nodelinks.push(currentnode);
>        }
>    }
>  }
>   autotext="";
>   update_GraphData();
> }

I wonder if you could extend the code to a general permutation algorithm?

[toc] | [prev] | [next] | [standalone]

#32663

jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:

> I wonder if you could 

"you" as in "one"?

> extend the code to a general permutation algorithm?

What is a "a general permutation algorithm"?

Do you mean you want a function that does something,
having externally defined arrays as input-parameters?

> extend the code

Here is the problem.

"You" do not "extend" a convoluted code to make it more general,
as its convolution will grow [perhaps even exponentially].

"You" start over again, explaining to yourself what such code must/should 
do, and then build an experimental function in a test-file full of 
breakpoints and/or console.log lines.

-- 
Evertjan.
The Netherlands.
(Please change the x'es to dots in my emailaddress)

[toc] | [prev] | [next] | [standalone]

#32665

Den fredag 3 mars 2017 kl. 13:02:43 UTC+1 skrev Evertjan.:
> jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
> 
> > I wonder if you could 
> 
> "you" as in "one"?
> 
> > extend the code to a general permutation algorithm?
> 
> What is a "a general permutation algorithm"?
> 
> Do you mean you want a function that does something,
> having externally defined arrays as input-parameters?
> 
> > extend the code
> 
> Here is the problem.
> 
> "You" do not "extend" a convoluted code to make it more general,
> as its convolution will grow [perhaps even exponentially].
> 
> "You" start over again, explaining to yourself what such code must/should 
> do, and then build an experimental function in a test-file full of 
> breakpoints and/or console.log lines.
> 
> -- 
> Evertjan.
> The Netherlands.
> (Please change the x'es to dots in my emailaddress)

Well EvertJan my code do create the sequense of pairings of nodes needed for all to all, and it do it in a rather efficient manner. That i can't see the most beautiful way to do it is rather another issue, i am not exactly a code guru, but i am handyman that cuts corners using the little knowledge i have.

I am on to next problem now, but of course i do know you people alot more skilled in both javascript and programming so i would urge you to post a more neat and tidy solution. And for sure if i just understand the approach i will use that instead, that is my purpose posting my halfbaked code attempts i do know i solve any problem, but i also know you people can beautify it and sometimes even make it more efficient.

Sometimes formulating the problem solve it for me, that is why i post things here. The process to write down the nuts and bolts often lead to the solution. I probably could do it for myself but that would not be half the fun, because sometimes you guys help out even when you resist.

[toc] | [prev] | [next] | [standalone]

#32666

Den fredag 3 mars 2017 kl. 18:07:57 UTC+1 skrev jonas.t...@gmail.com:
> Den fredag 3 mars 2017 kl. 13:02:43 UTC+1 skrev Evertjan.:
> > jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
> > 
> > > I wonder if you could 
> > 
> > "you" as in "one"?
> > 
> > > extend the code to a general permutation algorithm?
> > 
> > What is a "a general permutation algorithm"?
> > 
> > Do you mean you want a function that does something,
> > having externally defined arrays as input-parameters?
> > 
> > > extend the code
> > 
> > Here is the problem.
> > 
> > "You" do not "extend" a convoluted code to make it more general,
> > as its convolution will grow [perhaps even exponentially].
> > 
> > "You" start over again, explaining to yourself what such code must/should 
> > do, and then build an experimental function in a test-file full of 
> > breakpoints and/or console.log lines.
> > 
> > -- 
> > Evertjan.
> > The Netherlands.
> > (Please change the x'es to dots in my emailaddress)
> 
> Well EvertJan my code do create the sequense of pairings of nodes needed for all to all, and it do it in a rather efficient manner. That i can't see the most beautiful way to do it is rather another issue, i am not exactly a code guru, but i am handyman that cuts corners using the little knowledge i have.
> 
> I am on to next problem now, but of course i do know you people alot more skilled in both javascript and programming so i would urge you to post a more neat and tidy solution. And for sure if i just understand the approach i will use that instead, that is my purpose posting my halfbaked code attempts i do know i solve any problem, but i also know you people can beautify it and sometimes even make it more efficient.
> 
> Sometimes formulating the problem solve it for me, that is why i post things here. The process to write down the nuts and bolts often lead to the solution. I probably could do it for myself but that would not be half the fun, because sometimes you guys help out even when you resist.

A general permutation algorithm do differ from a counter Evertjan think about it. It use input values to create the sequense of the algorithm. Now one can argue that the possible outcome can not have more/higher entropy than the input, well at least it do create some diffusion.

[toc] | [prev] | [next] | [standalone]

#32667

jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:

> Well EvertJan my code do create the sequense of pairings of nodes needed
> for all to all, and it do it in a rather efficient manner. That i can't
> see the most beautiful way to do it is rather another issue, i am not
> exactly a code guru, but i am handyman that cuts corners using the
> little knowledge i have. 

I don't doubt your believe in yourself, but doubt your ability to judge that 
correctly.

> I am on to next problem now, but of course i do know you people alot
> more skilled in both javascript and programming so i would urge you to
> post a more neat and tidy solution.

Well that would be counterproductive, as the best we can do is help you get 
better, not doing your work.

> And for sure if i just understand
> the approach i will use that instead, that is my purpose posting my
> halfbaked code attempts i do know i solve any problem, but i also know
> you people can beautify it and sometimes even make it more efficient. 
> 
> Sometimes formulating the problem solve it for me, that is why i post
> things here.

If it does, why bother us with it?

> The process to write down the nuts and bolts often lead to
> the solution. I probably could do it for myself but that would not be
> half the fun, because sometimes you guys help out even when you resist. 
 
Indeed, I hope my resisting does help you get better at it.

==============================

But could you please answer the Qs I asked you?

> > I wonder if you could 
> 
> "you" as in "one"?
> 
> > extend the code to a general permutation algorithm?
> 
> What is a "a general permutation algorithm"?
> 
> Do you mean you want a function that does something,
> having externally defined arrays as input-parameters?



-- 
Evertjan.
The Netherlands.
(Please change the x'es to dots in my emailaddress)

[toc] | [prev] | [next] | [standalone]

#32668

Den fredag 3 mars 2017 kl. 18:20:20 UTC+1 skrev Evertjan.:
> jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
> 
> > Well EvertJan my code do create the sequense of pairings of nodes needed
> > for all to all, and it do it in a rather efficient manner. That i can't
> > see the most beautiful way to do it is rather another issue, i am not
> > exactly a code guru, but i am handyman that cuts corners using the
> > little knowledge i have. 
> 
> I don't doubt your believe in yourself, but doubt your ability to judge that 
> correctly.
> 
> > I am on to next problem now, but of course i do know you people alot
> > more skilled in both javascript and programming so i would urge you to
> > post a more neat and tidy solution.
> 
> Well that would be counterproductive, as the best we can do is help you get 
> better, not doing your work.
> 
> > And for sure if i just understand
> > the approach i will use that instead, that is my purpose posting my
> > halfbaked code attempts i do know i solve any problem, but i also know
> > you people can beautify it and sometimes even make it more efficient. 
> > 
> > Sometimes formulating the problem solve it for me, that is why i post
> > things here.
> 
> If it does, why bother us with it?
> 
> > The process to write down the nuts and bolts often lead to
> > the solution. I probably could do it for myself but that would not be
> > half the fun, because sometimes you guys help out even when you resist. 
>  
> Indeed, I hope my resisting does help you get better at it.
> 
> ==============================
> 
> But could you please answer the Qs I asked you?
> 
> > > I wonder if you could 
> > 
> > "you" as in "one"?
> > 
> > > extend the code to a general permutation algorithm?
> > 
> > What is a "a general permutation algorithm"?
> > 
> > Do you mean you want a function that does something,
> > having externally defined arrays as input-parameters?
> 
> 
> 
> -- 
> Evertjan.
> The Netherlands.
> (Please change the x'es to dots in my emailaddress)

Well you see if Evertjan if you can solve RSA on an atari emultating a mac, i really think you can solve any problem. Well if it is indeed solvable.

[toc] | [prev] | [next] | [standalone]

#32669

jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:

>> > > extend the code to a general permutation algorithm?
>> > 
>> > What is a "a general permutation algorithm"?
>> > 
>> > Do you mean you want a function that does something,
>> > having externally defined arrays as input-parameters?

 
> Well you see if Evertjan if you can solve RSA 

I don't see. What is RSA?

> on an atari emultating a
> mac, i really think you can solve any problem.

"You" as in "One"?

> Well if it is indeed solvable. 

My problem with you is that you don't answer my Qs.

Is that unsolvable?



-- 
Evertjan.
The Netherlands.
(Please change the x'es to dots in my emailaddress)

[toc] | [prev] | [next] | [standalone]

#32670

Den fredag 3 mars 2017 kl. 23:41:40 UTC+1 skrev Evertjan.:
> jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
> 
> >> > > extend the code to a general permutation algorithm?
> >> > 
> >> > What is a "a general permutation algorithm"?
> >> > 
> >> > Do you mean you want a function that does something,
> >> > having externally defined arrays as input-parameters?
> 
>  
> > Well you see if Evertjan if you can solve RSA 
> 
> I don't see. What is RSA?
> 
> > on an atari emultating a
> > mac, i really think you can solve any problem.
> 
> "You" as in "One"?
> 
> > Well if it is indeed solvable. 
> 
> My problem with you is that you don't answer my Qs.
> 
> Is that unsolvable?
> 
> 
> 
> -- 
> Evertjan.
> The Netherlands.
> (Please change the x'es to dots in my emailaddress)

Well RSA is an encryption scheme using two large primes creating a composite number. Still in use...

[toc] | [prev] | [next] | [standalone]

#32671

Den fredag 3 mars 2017 kl. 23:41:40 UTC+1 skrev Evertjan.:
> jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
> 
> >> > > extend the code to a general permutation algorithm?
> >> > 
> >> > What is a "a general permutation algorithm"?
> >> > 
> >> > Do you mean you want a function that does something,
> >> > having externally defined arrays as input-parameters?
> 
>  
> > Well you see if Evertjan if you can solve RSA 
> 
> I don't see. What is RSA?
> 
> > on an atari emultating a
> > mac, i really think you can solve any problem.
> 
> "You" as in "One"?
> 
> > Well if it is indeed solvable. 
> 
> My problem with you is that you don't answer my Qs.
> 
> Is that unsolvable?
> 
> 
> 
> -- 
> Evertjan.
> The Netherlands.
> (Please change the x'es to dots in my emailaddress)

Well anyone fit to solve composite number decomposition probably fit to solve any problem.

I can give you a hint star with the easy ones, 21

[toc] | [prev] | [next] | [standalone]

#32672

jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:

> Well anyone fit to solve composite number decomposition probably fit to
> solve any problem. 

A bold statement that needs evidence.

I don't think so, having been a family doctor for most of my life.

-- 
Evertjan.
The Netherlands.
(Please change the x'es to dots in my emailaddress)

[toc] | [prev] | [next] | [standalone]

#32673

Den lördag 4 mars 2017 kl. 00:07:45 UTC+1 skrev Evertjan.:
> jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
> 
> > Well anyone fit to solve composite number decomposition probably fit to
> > solve any problem. 
> 
> A bold statement that needs evidence.
> 
> I don't think so, having been a family doctor for most of my life.
> 
> -- 
> Evertjan.
> The Netherlands.
> (Please change the x'es to dots in my emailaddress)

Well they chosed RSA because integer factorization is "thought" to be a hard problem.
https://en.wikipedia.org/wiki/Integer_factorization


https://www.quora.com/Is-the-prime-factorization-problem-in-NP-class-If-not-supposing-P-NP-would-RSA-encryption-and-other-such-algorithms-which-rely-on-prime-factorization-being-hard-be-rendered-ineffective

[toc] | [prev] | [next] | [standalone]

#32674

jonas.thornvall@gmail.com wrote on 04 Mar 2017 in comp.lang.javascript:

> Den lБrdag 4 mars 2017 kl. 00:07:45 UTC+1 skrev Evertjan.:
>> jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
>> 
>> > Well anyone fit to solve composite number decomposition probably fit
>> > to solve any problem. 
>> 
>> A bold statement that needs evidence.
>> 
>> I don't think so, having been a family doctor for most of my life.

[please do not quote signatures on usenet, signature removed]

> Well they chosed RSA because integer factorization is "thought" to be a
> hard problem. https://en.wikipedia.org/wiki/Integer_factorization

I wouldn'd say 'they chosed', but anyway, that is not an argument against my 
argument that it is FALSE that all problems can be solved by 'anyone fit to 
solve composite number decomposition'.

Supposing you are both 'integer' and 'fit to solve composite number 
decomposition', just for the sake of agrument, could you solve the problem 
that we cannot find the supposed 50% antimatter in our universe?



-- 
Evertjan.
The Netherlands.
(Please change the x'es to dots in my emailaddress)

[toc] | [prev] | [next] | [standalone]

#32675

Den lördag 4 mars 2017 kl. 12:35:55 UTC+1 skrev Evertjan.:
> jonas.thornvall@gmail.com wrote on 04 Mar 2017 in comp.lang.javascript:
> 
> > Den l혀rdag 4 mars 2017 kl. 00:07:45 UTC+1 skrev Evertjan.:
> >> jonas.thornvall@gmail.com wrote on 03 Mar 2017 in comp.lang.javascript:
> >> 
> >> > Well anyone fit to solve composite number decomposition probably fit
> >> > to solve any problem. 
> >> 
> >> A bold statement that needs evidence.
> >> 
> >> I don't think so, having been a family doctor for most of my life.
> 
> [please do not quote signatures on usenet, signature removed]
> 
> > Well they chosed RSA because integer factorization is "thought" to be a
> > hard problem. https://en.wikipedia.org/wiki/Integer_factorization
> 
> I wouldn'd say 'they chosed', but anyway, that is not an argument against my 
> argument that it is FALSE that all problems can be solved by 'anyone fit to 
> solve composite number decomposition'.
> 
> Supposing you are both 'integer' and 'fit to solve composite number 
> decomposition', just for the sake of agrument, could you solve the problem 
> that we cannot find the supposed 50% antimatter in our universe?
> 
> 
> 
> -- 
> Evertjan.
> The Netherlands.
> (Please change the x'es to dots in my emailaddress)

Well Evertjan as i understand it the expansion of universe is a "conjecture" due to the observed redshift. And the antimatter is needed to explain the expansion...

You really suggest me to go on try solve something that may be totally wrong from start to end?

No Everjan i deal with realworld problems not fictional ones.

[toc] | [prev] | [next] | [standalone]

#32676

jonas.thornvall@gmail.com wrote on 04 Mar 2017 in comp.lang.javascript:

> Well Evertjan as i understand it the expansion of universe is a
> "conjecture" due to the observed redshift.

Good thing the universe is not as you understand it,
and don't claim that it is so,
when I don't come up with a better understanding.

> And the antimatter is needed to explain the expansion... 

You are not explaining such need, just conjecturing authority.

> You really suggest me to go on try solve something that may be totally
> wrong from start to end? 

No, I asked you to show that your stand that 'anyone fit to solve composite 
number decomposition' can solve anything.

Even if you were able to solve my example, that would only mean that 
'someone' could, not hat 'anyone' could.

> No Everjan i deal with realworld problems not fictional ones.

You seem to have no idea about the problems of the real world, 
also called 'our universe'.

I submit that algoritms are fictional problems,
while disease, lonelyness, global warming, cultural misogeny,
child abuse, religion, blind faith, to name a few, are the real ones.

But be my guest and retract into your pseudo-reality of algoritms.

-- 
Evertjan.
The Netherlands.
(Please change the x'es to dots in my emailaddress)

[toc] | [prev] | [next] | [standalone]

#32677

jonas.t...@gmail.com wrote:

> Well they chosed RSA because integer factorization is "thought" to be a hard problem.

You seem to deeply misunderstand what a "hard" problem is in Computer Science. This is not a matter of opinion, and no scare quotes are needed. This is a well defined. I invite you to learn the basics of the Theory of Computation before making such claims.

Here is an intro on the most famous Complexity Class:

<https://www.youtube.com/watch?v=msp2y_Y5MLE>

[toc] | [prev] | [next] | [standalone]

#32678

"Michael Haufe (TNO)" <tno@thenewobjective.com> writes:

> jonas.t...@gmail.com wrote:
>
>> Well they chosed RSA because integer factorization is "thought" to be
>> a hard problem.
>
> You seem to deeply misunderstand what a "hard" problem is in Computer
> Science. This is not a matter of opinion, and no scare quotes are
> needed. This is a well defined.

NP-hard is precisely defined, but would you say that when someone talks
about a hard problem they always mean NP-hard?  I suppose that's the
natural thing to assume when talking about complexity but I wouldn't be
certain.  It still carries a strong informal meaning.

Anyway, if we take hard to mean NP-hard then integer factorisation is
not know to be hard, and most people would say that they don't expect it
to turn out to be.  The key new fact being that we now know that
primality testing is in P which puts the decision problem version of
factorisation in co-NP.

<snip>
-- 
Ben.

[toc] | [prev] | [next] | [standalone]

Page 1 of 3  [1] 2 3  Next page →

Back to top | Article view | comp.lang.javascript

csiph-web