Re:P versus NP Explained
by j2kun on Monday February 03, 2014 @10:06AM
(#7170951)
Not true. You can just use the characterization of NP in terms of certificates and deterministic verifying machines, and still get everything (except maybe the standard proof of the Karp-Lipton theorem).
[ Parent
| on HN ]
Watch out where you stand. Sons of Turing are a large mafia, which will immediately reduce every other computational construct into TMs and claim you didn't really add up anything :)