A Note on Non-deterministic Turing Machine and the "P vs. NP ( P versus NP problem )"
Zheng-Ling YANG · 2021
摘要：一个非确定型图灵机NDTM的计算过程，可以相当于其对应的确定型图灵机DTM的幂集。如果接受ZF公理系统的幂集公理，“P对NP”问题最可能的答案是：对于确定型图灵机，P≠NP。可以从另外3个角度对它进行一定的解释。ABSTRACT: The calculation process of a non-deterministic Turing machine (NDTM) can be equipotent to the power set of its corresponding deterministic Turing machine (DTM). If accepting the “Axiom of power set” of the ZF axiom system ( Zermelo–Fraenkel set theory ), the most likely answer to the "P vs. NP" ( P versus NP problem ) is: For a deterministic Turing machine, P≠NP ( P is not equal to NP ). This answer can be explained from three other perspectives.