关于P= NP的不可能性及NP的伪随机性
About the impossibility to prove P=NP and the pseudo-randomness in NP
摘要：
复杂性类P和NP之间的关系是理论计算机科学领域尚未解决的问题。在本文中，我们将研究P-NP问题与问题的“确定性”与“非确定性”性质之间的联系，更具体地说，研究NP类问题中复杂性的时间性质。让我们提醒一下，NP类被称为“非确定性多项式”语言类。使用Meta参数，结果在数学应该是“时间独立的”，因为他们是可重复的，该文件表明，P！= NP断言在非时态数学框架中是不可能证明的。在报告的前一个版本中，我们使用了一个类似的基于随机性的论点来证明P = NP断言也是不可能证明的，但这部分论文被证明是不正确的。事实上，本文强调了任何NP问题的复杂性的时间依赖性，这与其核心的一些伪随机性有关。
英文摘要：
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic" nature of a problem, and more specifically at the temporal nature of the complexity within the NP class of problems. Let us remind that the NP class is called the class of "Non Deterministic Polynomial" languages. Using the meta argument that results in Mathematics should be "time independent" as they are reproducible, the paper shows that the P!=NP assertion is impossible to prove in the a-temporal framework of Mathematics. In a previous version of the report, we use a similar argument based on randomness to show that the P = NP assertion was also impossible to prove, but this part of the paper was shown to be incorrect. So, this version deletes it. In fact, this paper highlights the time dependence of the complexity for any NP problem, linked to some pseudo-randomness in its heart.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
