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

P=NP is impossible on a turing machine

Name: Anonymous 2008-06-09 12:10

The reason?

Because you can not add in one motion.  It is impossible to be given numbers: 3,4,6 and add three to each in one motion.  If this was possible NP complete problems would be simple.  Without this criteria it is impossible to solve NP complete problems without exponential time.

The problem of NP complete problems are not suited to the computer.  Another means of calculation would be better suited.

Name: Anonymous 2008-06-09 12:56

>>6
>model numbers closer to reality"
What?

>overlap means jack shit in NP complete problems
What??

>the "reality computer" has these obscene space storage abilities
What???

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