Relativizations of P=NP and P6=NP in ARNN Model
نویسنده
چکیده
We will provide a formalization of the use of real weights in analog recurrent neural networks as a restricted class of oracles, closely related to physical oracles, and prove that the famous P = NP problem relativizes with respect to deterministic and nonderterministic analog recurrent neural networks with real weights working in polynomial time. As a direct consequence, these devices have restricted computational power.
منابع مشابه
Independence of P vs. NP in regards to oracle relativizations
Previously in “P is a proper subset of NP” [Meek Article 1 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizatio...
متن کاملThe ARNN model relativises P=NP and P!=NP
In this paper we prove that the relations P = NP and P 6= NP relativise to the deterministic / non-deterministic artificial recurrent neural net (ARNN ) with real weights (informally considered as oracles in [1] and [2]). Although, in the nineties, a dozen of papers were written on the ARNN model, some introducing computation via neural nets with real weights and some introducing non-determinis...
متن کاملM ay 2 00 8 Independence of P vs . NP in regards to oracle
Previously in “P is a proper subset of NP” [Meek Article 1, 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2, 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizat...
متن کاملar X iv : 0 80 5 . 21 70 v 4 [ cs . C C ] 2 1 M ay 2 00 8 Independence of P vs . NP in regards to oracle
Previously in “P is a proper subset of NP” [Meek Article 1, 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2, 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizat...
متن کاملar X iv : 0 80 5 . 21 70 v 1 [ cs . C C ] 1 4 M ay 2 00 8 Independence of P vs . NP in regards to oracle
This is the third article in a series of four articles dealing with the P vs. NP question. The purpose of this work is to demonstrate that although the oracle relativizations of the NP complexity class eliminate some methods as possible routes to a solution, the methods used in the first two articles of this series are not affected by oracle relativizations. Furthermore, the solution to the P v...
متن کامل