A Proof for P vs. NP Problem

http://arxiv.org/abs/1005.3010

``This paper proposes a theoretic proof for P vs. NP problem. The central idea of this proof is a recursive definition for Turing machine (shortly TM). By the definition, an infinite sequence of TM is constructed and it is proved that the sequence includes all TM. Based on these TM, the class D that includes all decidable languages is defined. By proving P=D, the result P=NP is proved.''

>>21
You've made the mistake explicit now. Without a proof (at least) there is no guarantee that the PTIME solution will beat the EXPTIME solution at practical magnitudes, or even the magnitudes of interest.