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

Tests

Name: Anonymous 2013-05-30 11:45

My dear /prog/riders, what and how do you test and why?

Personally I prefer to skip unit tests entirely and focus on integration tests that will catch the same things that unit tests would minus time for writing bloat code for unit tests.

Name: Anonymous 2013-05-30 11:49

Who gives a shit about TDD?

THIS THREAD HAS CHANGED TOPIC
http://arxiv.org/ftp/arxiv/papers/1305/1305.5976.pdf
In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.
SOMEONE EXPLAIN THIS SHIT

Name: Anonymous 2013-05-30 11:55

>>2
How did this get on arXiv? It doesn't even have LATEX!

Name: Anonymous 2013-05-30 12:22

>>2
Well, we're boned.

Name: Anonymous 2013-05-30 13:59

>>2
It's over, [b][u]COMPUTER SCIENCE[/b][/u] is finished!

Name: Anonymous 2013-05-30 14:22

>>2
All the results show that our polynomial time algorithm can get the same  answer as the backtracking algorithm does. NO EXCEPTION.

Name: Anonymous 2013-05-30 14:51

>>2
i do...

Name: Anonymous 2013-05-30 15:05

>>2
this can't be real

Name: Anonymous 2013-05-30 15:36

>>4
who are you?

Name: Anonymous 2013-05-30 15:45

>>9
It's me, Bender!

Name: Anonymous 2013-05-30 16:01

>>2
MSP problem is to determine the existence of a simple path in a labeled multistage graph. Obviously, this
problem is a NP problem.
Well I got stuck here because it's not obvious to me at all. I'll read through it though and see what is going on.

Name: Anonymous 2013-05-30 16:27

>>11
That's just the Chinese way of saying ``It's convinient for me so it must be true''.

Name: Anonymous 2013-05-30 16:28

    LLEELALLLLLLLE ELLEELELEL
    XWWWWWWINNNNNG GRO GRO GO GROLOLOL XDDDDDDDDDDDDDDDDDDDDDDDDDDD

Name: Anonymous 2013-05-30 19:43

>>13
take your fucking pills you retarded piece of shit

Name: Anonymous 2013-05-30 20:35

P=NP
I FUCKING KNEW IT

Name: Anonymous 2013-05-30 22:04

But the paper doesn't look like it is ACCEPTED quality!

Name: Anonymous 2013-05-30 22:20

>>16
But it's on arXiv!

Name: Anonymous 2013-05-30 23:02

http://www.win.tue.nl/~gwoegi/P-versus-NP.htm
[Equal]: In April 2009, Xinwen Jiang published a proof for P is equal to NP. He provided an algorithm for the Hamilton circuit problem, and states "It seems our algorithm is a polynomial one". The paper can be found at http://xinwenjiang.googlepages.com/. An earlier version of his paper was published in a Chinese journal in 2007. Further versions have been published in 2010 and 2011. More information on the current version of the proof is available at http://trytoprovenpvsp.blog.sohu.com/entry/. Since May 2013, the paper "A Polynomial Time Algorithm for the Hamilton Circuit Problem" is available at http://arxiv.org/abs/1305.5976.

Name: Anonymous 2013-05-30 23:58

Yeah fuck having P = NP. Only humans can do proofs! Beautiful ones especially! fuck hard ai!

Name: Anonymous 2013-05-31 1:15

Chinese science is shit. All the chink programmers I've ever worked with were shit and only pretended to program. I'd trust an Indian over a Chinaman. I'll wait until it has citations in REAL journals before I believe anything.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List