Re:P = NP
by topynate on Wednesday December 04, 2013 @06:56AM
(#6846333)
I'm confident that the paper is indeed flawed. However, a Turing machine can neither write to nor read from an exponential number of locations in polynomial time, so the flaw will be something else.
[ Parent
| on HN ]
There are no comments on this comment yet.