P=NP is impossible on a turing machine

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.

>>33
crackpots often use the word "theory" to describe things that are not, in fact, scientific theories.
can you prove that determining whether the universe is infinitely large is not equivalent to the halting problem? that's what i want proof of, not whether the universe actually is of infinite size or not.