Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

P = NP

Name: Anonymous 2011-10-04 1:26

Anyone else work on solving this problem through a polynomial time algorithm to a known np complete problem?

Name: Anonymous 2011-10-04 1:30

Also why is algorithm design so flawed right now.

Name: Anonymous 2011-10-04 2:33

anyone working on this problem is a quack

Name: Anonymous 2011-10-04 2:38

>>2
Because Turing machines are easier to build than lambda calculus machines.

Name: Anonymous 2011-10-04 2:48

>>3
fuck you faggot

Name: Anonymous 2011-10-04 2:56

>>2

cuz, it's like, really hard man.

>>1

Naw, I've always found trying to do that to be way to discouraging. I'm into learning more about the theory though.

Name: Anonymous 2011-10-04 7:40

It's easy

if
P = NP
then by division by P
1 = N
solv'd

Name: Anonymous 2011-10-04 7:43

>>7
That's not the only solution. If P is zero then N can be anything.

P = NP

1 Name: Anonymous 2011-10-04 1:26

2 Name: Anonymous 2011-10-04 1:30

3 Name: Anonymous 2011-10-04 2:33

4 Name: Anonymous 2011-10-04 2:38

5 Name: Anonymous 2011-10-04 2:48

6 Name: Anonymous 2011-10-04 2:56

7 Name: Anonymous 2011-10-04 7:40

8 Name: Anonymous 2011-10-04 7:43